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.r476-tall-171620505900452.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 ClientsAndServers-PT-N0020P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505900452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 22:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 22:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 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 ClientsAndServers-PT-N0020P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717207248098

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:00:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:00:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:00:49] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-06-01 02:00:49] [INFO ] Transformed 25 places.
[2024-06-01 02:00:49] [INFO ] Transformed 18 transitions.
[2024-06-01 02:00:49] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 12 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-06-01 02:00:49] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 02:00:49] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 02:00:49] [INFO ] Invariant cache hit.
[2024-06-01 02:00:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:00:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 247 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 50 constraints, problems are : Problem set: 0 solved, 17 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 477ms
Finished structural reductions in LTL mode , in 1 iterations and 762 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 23 out of 25 places after structural reductions.
[2024-06-01 02:00:50] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:00:50] [INFO ] Flatten gal took : 4 ms
[2024-06-01 02:00:50] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 8458 steps (1 resets) in 71 ms. (117 steps per ms) remains 0/19 properties
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' '!(X(X((F(p1)||p0))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 6 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:00:51] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:00:51] [INFO ] Implicit Places using invariants in 56 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-00
Product exploration explored 100000 steps with 33333 reset in 194 ms.
Product exploration explored 100000 steps with 33333 reset in 131 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 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 24 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-00 finished in 785 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(X(F((p0||X(p0)))))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 3 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:00:51] [INFO ] Invariant cache hit.
[2024-06-01 02:00:51] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-01
Product exploration explored 100000 steps with 1519 reset in 218 ms.
Product exploration explored 100000 steps with 1476 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 7322 steps (3 resets) in 35 ms. (203 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:00:53] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:00:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 02:00:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:00:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:00:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 02:00:53] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 02:00:53] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:00:53] [INFO ] Added : 12 causal constraints over 3 iterations in 14 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:00:53] [INFO ] Invariant cache hit.
[2024-06-01 02:00:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:00:53] [INFO ] Invariant cache hit.
[2024-06-01 02:00:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:00:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 266ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 267ms
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 20/20 places, 18/18 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4434 steps (1 resets) in 7 ms. (554 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 02:00:54] [INFO ] Invariant cache hit.
[2024-06-01 02:00:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:00:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:00:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:00:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:00:54] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:00:54] [INFO ] Added : 12 causal constraints over 3 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1521 reset in 93 ms.
Product exploration explored 100000 steps with 1506 reset in 100 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 8 place count 20 transition count 18
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 15 transition count 13
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 23 rules in 17 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2024-06-01 02:00:55] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 15 cols
[2024-06-01 02:00:55] [INFO ] Computed 3 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 18 constraints, problems are : Problem set: 8 solved, 4 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 4/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/22 constraints. Problems are: Problem set: 8 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 22 constraints, problems are : Problem set: 8 solved, 4 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 4/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 8 solved, 4 unsolved
Search for dead transitions found 8 dead transitions in 123ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 5/18 transitions.
Graph (complete) has 12 edges and 15 vertex of which 7 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 7 /15 variables (removed 8) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/20 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 148 ms. Remains : 7/20 places, 5/18 transitions.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:00:55] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:00:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:00:55] [INFO ] Invariant cache hit.
[2024-06-01 02:00:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:00:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 249ms
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-01 finished in 3669 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 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 6 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 02:00:55] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:00:55] [INFO ] Implicit Places using invariants in 24 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 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 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Applied a total of 2 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 02:00:55] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:00:55] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:00:55] [INFO ] Invariant cache hit.
[2024-06-01 02:00:55] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 78 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-02
Product exploration explored 100000 steps with 8 reset in 90 ms.
Product exploration explored 100000 steps with 12 reset in 194 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 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 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 644 steps (0 resets) in 8 ms. (71 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 02:00:56] [INFO ] Invariant cache hit.
[2024-06-01 02:00:56] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 02:00:56] [INFO ] Invariant cache hit.
[2024-06-01 02:00:56] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 02:00:56] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 02:00:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 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/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 118ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 118ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 9/9 places, 7/7 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 644 steps (0 resets) in 4 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 116 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 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 77 ms.
Product exploration explored 100000 steps with 8 reset in 111 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 02:00:57] [INFO ] Invariant cache hit.
[2024-06-01 02:00:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:00:57] [INFO ] Invariant cache hit.
[2024-06-01 02:00:57] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-06-01 02:00:57] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 02:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 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/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 187 ms. Remains : 9/9 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-02 finished in 1988 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(X(F(p0)))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:00:57] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:00:57] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-03
Product exploration explored 100000 steps with 1332 reset in 134 ms.
Product exploration explored 100000 steps with 1347 reset in 122 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 4287 steps (0 resets) in 7 ms. (535 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:00:58] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 02:00:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:00:58] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 02:00:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 02:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:00:58] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:00:58] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 02:00:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 02:00:58] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:00:58] [INFO ] Added : 13 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:00:58] [INFO ] Invariant cache hit.
[2024-06-01 02:00:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:00:58] [INFO ] Invariant cache hit.
[2024-06-01 02:00:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:00:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 265ms
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 21/21 places, 18/18 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 3815 steps (0 resets) in 9 ms. (381 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 02:00:59] [INFO ] Invariant cache hit.
[2024-06-01 02:00:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:00:59] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 02:00:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:00:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:00:59] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 02:00:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 02:00:59] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:00:59] [INFO ] Added : 13 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1346 reset in 95 ms.
Product exploration explored 100000 steps with 1353 reset in 106 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 7 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-06-01 02:01:00] [INFO ] Redundant transitions in 1 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-06-01 02:01:00] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 21 constraints, problems are : Problem set: 8 solved, 5 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/17 variables, 3/3 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 5/26 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/26 constraints. Problems are: Problem set: 8 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 26 constraints, problems are : Problem set: 8 solved, 5 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 5/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 8 solved, 5 unsolved
Search for dead transitions found 8 dead transitions in 147ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 6/18 transitions.
Graph (complete) has 16 edges and 17 vertex of which 9 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 9 /17 variables (removed 8) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/21 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 163 ms. Remains : 9/21 places, 6/18 transitions.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:01:00] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:01:00] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:01:00] [INFO ] Invariant cache hit.
[2024-06-01 02:01:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 254ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 254ms
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-03 finished in 3342 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&&X((F(p0)&&F(p1))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:01:00] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:01:00] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-04
Product exploration explored 100000 steps with 1052 reset in 97 ms.
Product exploration explored 100000 steps with 1075 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 114 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
RANDOM walk for 4276 steps (0 resets) in 20 ms. (203 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 296 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:01:02] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:01:02] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:01:02] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 02:01:02] [INFO ] Invariant cache hit.
[2024-06-01 02:01:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 02:01:02] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:01:02] [INFO ] Added : 15 causal constraints over 3 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:01:02] [INFO ] Invariant cache hit.
[2024-06-01 02:01:02] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:01:02] [INFO ] Invariant cache hit.
[2024-06-01 02:01:02] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 270ms
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 116 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
RANDOM walk for 5764 steps (1 resets) in 14 ms. (384 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 232 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
[2024-06-01 02:01:03] [INFO ] Invariant cache hit.
[2024-06-01 02:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 02:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:03] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:01:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:03] [INFO ] Added : 11 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 02:01:03] [INFO ] Invariant cache hit.
[2024-06-01 02:01:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:01:03] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:03] [INFO ] Added : 15 causal constraints over 3 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1070 reset in 88 ms.
Product exploration explored 100000 steps with 1058 reset in 102 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 16 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-06-01 02:01:04] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 17 cols
[2024-06-01 02:01:04] [INFO ] Computed 4 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/21 constraints. Problems are: Problem set: 6 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 21 constraints, problems are : Problem set: 6 solved, 7 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 7/17 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 7/28 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/28 constraints. Problems are: Problem set: 6 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 28 constraints, problems are : Problem set: 6 solved, 7 unsolved in 59 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 143ms problems are : Problem set: 6 solved, 7 unsolved
Search for dead transitions found 6 dead transitions in 145ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 8/18 transitions.
Graph (complete) has 17 edges and 17 vertex of which 11 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /17 variables (removed 6) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/21 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 11/21 places, 8/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:01:04] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:01:04] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:01:04] [INFO ] Invariant cache hit.
[2024-06-01 02:01:04] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 256ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 257ms
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-04 finished in 3965 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 G(!p1))||G(p2))))'
Support contains 3 out of 25 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 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 4 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 02:01:04] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:01:04] [INFO ] Implicit Places using invariants in 22 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29 ms. Remains : 12/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND p1 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 128 ms.
Stack based approach found an accepted trace after 21222 steps with 0 reset with depth 21223 and stack size 21184 in 43 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-05 finished in 256 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 p1)||G(p2)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
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 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 5 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-06-01 02:01:05] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:01:05] [INFO ] Implicit Places using invariants in 23 ms returned [9, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/25 places, 11/18 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 1 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 9
Applied a total of 4 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-06-01 02:01:05] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:01:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:01:05] [INFO ] Invariant cache hit.
[2024-06-01 02:01:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/25 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 11/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-06
Product exploration explored 100000 steps with 13925 reset in 96 ms.
Product exploration explored 100000 steps with 13857 reset in 105 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) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 127 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 16619 steps (9 resets) in 22 ms. (722 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) p2))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 21 factoid took 356 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 02:01:06] [INFO ] Invariant cache hit.
[2024-06-01 02:01:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:06] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:06] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:06] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 02:01:06] [INFO ] Invariant cache hit.
[2024-06-01 02:01:06] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:06] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:06] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:06] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:06] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 11 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 : 11/11 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-06-01 02:01:06] [INFO ] Invariant cache hit.
[2024-06-01 02:01:06] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:01:06] [INFO ] Invariant cache hit.
[2024-06-01 02:01:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 02:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 02:01:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/20 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 0/20 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 14 constraints, problems are : Problem set: 0 solved, 8 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 9/20 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 22 constraints, problems are : Problem set: 0 solved, 8 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 11/11 places, 9/9 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 p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
RANDOM walk for 11275 steps (5 resets) in 14 ms. (751 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 351 ms. Reduced automaton from 6 states, 15 edges and 2 AP (stutter insensitive) to 6 states, 15 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
[2024-06-01 02:01:08] [INFO ] Invariant cache hit.
[2024-06-01 02:01:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:08] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:08] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 02:01:08] [INFO ] Invariant cache hit.
[2024-06-01 02:01:08] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:01:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:08] [INFO ] Computed and/alt/rep : 8/9/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:08] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), false, false, false]
Product exploration explored 100000 steps with 13938 reset in 56 ms.
Product exploration explored 100000 steps with 13901 reset in 67 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 9/9 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 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 02:01:08] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:01:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:01:08] [INFO ] Invariant cache hit.
[2024-06-01 02:01:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 02:01:08] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 02:01:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 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/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 89ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/11 places, 7/9 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 9/11 places, 7/9 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-06 finished in 3945 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(!p0) U (p1||(!p1 U p2))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
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 4 rules applied. Total rules applied 4 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 9 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 2 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-06-01 02:01:09] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 02:01:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:01:09] [INFO ] Invariant cache hit.
[2024-06-01 02:01:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 02:01:09] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 02:01:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/26 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/26 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 150ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/25 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 15/25 places, 11/18 transitions.
Stuttering acceptance computed with spot in 180 ms :[p0, true, (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-07
Product exploration explored 100000 steps with 15159 reset in 80 ms.
Product exploration explored 100000 steps with 15131 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 132 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 412 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
RANDOM walk for 30507 steps (15 resets) in 43 ms. (693 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR p1 p2 (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0)))]
Knowledge based reduction with 19 factoid took 659 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 568 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
Stuttering acceptance computed with spot in 414 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
[2024-06-01 02:01:11] [INFO ] Invariant cache hit.
[2024-06-01 02:01:11] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:11] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:11] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:11] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:11] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 02:01:11] [INFO ] Invariant cache hit.
[2024-06-01 02:01:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:01:11] [INFO ] Invariant cache hit.
[2024-06-01 02:01:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 02:01:11] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 02:01:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/26 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/26 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 159ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 215 ms. Remains : 15/15 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 139 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 409 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
RANDOM walk for 34924 steps (16 resets) in 64 ms. (537 steps per ms) remains 0/14 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT (OR p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR p1 p2 (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0)))]
Knowledge based reduction with 27 factoid took 632 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter insensitive) to 10 states, 28 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 353 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
Stuttering acceptance computed with spot in 344 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
[2024-06-01 02:01:14] [INFO ] Invariant cache hit.
[2024-06-01 02:01:14] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:14] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:14] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:14] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 389 ms :[p0, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, false, false, false, false, false]
Product exploration explored 100000 steps with 15135 reset in 77 ms.
Product exploration explored 100000 steps with 15206 reset in 116 ms.
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2024-06-01 02:01:14] [INFO ] Invariant cache hit.
[2024-06-01 02:01:14] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 02:01:14] [INFO ] Invariant cache hit.
[2024-06-01 02:01:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 02:01:14] [INFO ] Redundant transitions in 1 ms returned []
Running 10 sub problems to find dead transitions.
[2024-06-01 02:01:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/26 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 20 constraints, problems are : Problem set: 0 solved, 10 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 11/26 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 30 constraints, problems are : Problem set: 0 solved, 10 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 179ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 262 ms. Remains : 15/15 places, 11/11 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-07 finished in 5978 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(F((G(F(p0))||(F(p0)&&G(!p1)))))||(F(!p0)&&X(F((G(F(p0))||(F(p0)&&G(!p1)))))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:01:15] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:01:15] [INFO ] Implicit Places using invariants in 49 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-08
Product exploration explored 100000 steps with 1690 reset in 90 ms.
Product exploration explored 100000 steps with 1679 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
RANDOM walk for 3234 steps (0 resets) in 12 ms. (248 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 319 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:01:16] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:01:16] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:01:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:16] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:01:16] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:16] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:01:16] [INFO ] Invariant cache hit.
[2024-06-01 02:01:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:01:16] [INFO ] Invariant cache hit.
[2024-06-01 02:01:16] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 228ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 228ms
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 20/20 places, 18/18 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 p1) (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
RANDOM walk for 8096 steps (4 resets) in 11 ms. (674 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2024-06-01 02:01:17] [INFO ] Invariant cache hit.
[2024-06-01 02:01:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:01:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 02:01:17] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:17] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 1703 reset in 87 ms.
Product exploration explored 100000 steps with 1673 reset in 101 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 20 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 16 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 16 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 16 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 15 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 4 ms. Remains 15 /20 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2024-06-01 02:01:18] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 15 cols
[2024-06-01 02:01:18] [INFO ] Computed 3 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/18 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 18 constraints, problems are : Problem set: 7 solved, 5 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/15 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 13/28 variables, 15/18 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/23 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 23 constraints, problems are : Problem set: 7 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 5/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 114ms problems are : Problem set: 7 solved, 5 unsolved
Search for dead transitions found 7 dead transitions in 114ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 6/18 transitions.
Graph (complete) has 13 edges and 15 vertex of which 8 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 8 /15 variables (removed 7) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/20 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 8/20 places, 6/18 transitions.
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:01:18] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:01:18] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 02:01:18] [INFO ] Invariant cache hit.
[2024-06-01 02:01:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-08 finished in 3897 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 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 2 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2024-06-01 02:01:18] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:01:18] [INFO ] Implicit Places using invariants in 25 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 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 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-06-01 02:01:18] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 02:01:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:01:18] [INFO ] Invariant cache hit.
[2024-06-01 02:01:18] [INFO ] Implicit Places using invariants and state equation in 20 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 : 5/25 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 71 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 66 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-09
Product exploration explored 100000 steps with 4997 reset in 85 ms.
Stack based approach found an accepted trace after 61 steps with 3 reset with depth 17 and stack size 17 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-09 finished in 235 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((!p0&&(G(p1) U G(p0)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:01:19] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:01:19] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 210 ms :[true, true, true, (AND p0 (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-10 finished in 261 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((p0&&X(G(p1)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:01:19] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:01:19] [INFO ] Implicit Places using invariants in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 33 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-11 finished in 162 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 X((p1||X(G(p1)))))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 4 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 02:01:19] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:01:19] [INFO ] Implicit Places using invariants in 21 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 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 1 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 02:01:19] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:01:19] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 02:01:19] [INFO ] Invariant cache hit.
[2024-06-01 02:01:19] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-12
Product exploration explored 100000 steps with 22049 reset in 50 ms.
Product exploration explored 100000 steps with 22113 reset in 57 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 976 steps (1 resets) in 5 ms. (162 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 300 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 02:01:20] [INFO ] Invariant cache hit.
[2024-06-01 02:01:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:01:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:20] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:20] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:20] [INFO ] Invariant cache hit.
[2024-06-01 02:01:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 02:01:20] [INFO ] Invariant cache hit.
[2024-06-01 02:01:20] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 02:01:20] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 538 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 783 steps (0 resets) in 4 ms. (156 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 395 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 02:01:22] [INFO ] Invariant cache hit.
[2024-06-01 02:01:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:22] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:22] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:22] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7095 reset in 64 ms.
Product exploration explored 100000 steps with 6030 reset in 98 ms.
Support contains 3 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:22] [INFO ] Invariant cache hit.
[2024-06-01 02:01:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:01:22] [INFO ] Invariant cache hit.
[2024-06-01 02:01:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 02:01:22] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-12 finished in 2921 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||X(X(G(p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:01:22] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:01:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:01:22] [INFO ] Invariant cache hit.
[2024-06-01 02:01:22] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 277ms
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 330 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-14 finished in 512 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 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:01:23] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:01:23] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 02:01:23] [INFO ] Invariant cache hit.
[2024-06-01 02:01:23] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:01:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 121 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-15
Entered a terminal (fully accepting) state of product in 124 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-15 finished in 469 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(X(F((p0||X(p0)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-01
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 4 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 02:01:23] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:01:23] [INFO ] Implicit Places using invariants in 24 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/25 places, 7/18 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 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 0 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-06-01 02:01:23] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:01:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:01:23] [INFO ] Invariant cache hit.
[2024-06-01 02:01:23] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 71 ms. Remains : 6/25 places, 5/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-01
Product exploration explored 100000 steps with 10211 reset in 52 ms.
Product exploration explored 100000 steps with 10220 reset in 53 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 596 steps (0 resets) in 4 ms. (119 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 02:01:24] [INFO ] Invariant cache hit.
[2024-06-01 02:01:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:24] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:24] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:24] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:24] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:01:24] [INFO ] Invariant cache hit.
[2024-06-01 02:01:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:01:24] [INFO ] Invariant cache hit.
[2024-06-01 02:01:24] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 4 sub problems to find dead transitions.
[2024-06-01 02:01:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 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/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 6/6 places, 5/5 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 984 steps (1 resets) in 5 ms. (164 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 02:01:25] [INFO ] Invariant cache hit.
[2024-06-01 02:01:25] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:25] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 02:01:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:25] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:25] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:25] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10192 reset in 44 ms.
Product exploration explored 100000 steps with 10187 reset in 51 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 250 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:01:26] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 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/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 6/6 places, 5/5 transitions.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:01:26] [INFO ] Invariant cache hit.
[2024-06-01 02:01:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:01:26] [INFO ] Invariant cache hit.
[2024-06-01 02:01:26] [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 4 sub problems to find dead transitions.
[2024-06-01 02:01:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 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/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 66ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in LTL mode , in 1 iterations and 107 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-01 finished in 2907 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(X(X(F(p0)))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-03
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 5 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 02:01:26] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:01:26] [INFO ] Implicit Places using invariants in 26 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/25 places, 8/18 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 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 0 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:01:26] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:01:26] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:01:26] [INFO ] Invariant cache hit.
[2024-06-01 02:01:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 71 ms. Remains : 8/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-03
Product exploration explored 100000 steps with 7407 reset in 53 ms.
Product exploration explored 100000 steps with 7362 reset in 58 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 : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1792 steps (4 resets) in 5 ms. (298 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 94 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 02:01:27] [INFO ] Invariant cache hit.
[2024-06-01 02:01:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:27] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:27] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:27] [INFO ] Invariant cache hit.
[2024-06-01 02:01:27] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:01:27] [INFO ] Invariant cache hit.
[2024-06-01 02:01:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 812 steps (0 resets) in 6 ms. (116 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-06-01 02:01:28] [INFO ] Invariant cache hit.
[2024-06-01 02:01:28] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:28] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:28] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:28] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7418 reset in 54 ms.
Product exploration explored 100000 steps with 7419 reset in 58 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:28] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 75ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:29] [INFO ] Invariant cache hit.
[2024-06-01 02:01:29] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:01:29] [INFO ] Invariant cache hit.
[2024-06-01 02:01:29] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in LTL mode , in 1 iterations and 124 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-03 finished in 2705 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&&X((F(p0)&&F(p1))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-04
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 3 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 02:01:29] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:01:29] [INFO ] Implicit Places using invariants in 25 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/25 places, 9/18 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 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-06-01 02:01:29] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:01:29] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 02:01:29] [INFO ] Invariant cache hit.
[2024-06-01 02:01:29] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/25 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 81 ms. Remains : 11/25 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-04
Product exploration explored 100000 steps with 4133 reset in 75 ms.
Product exploration explored 100000 steps with 4164 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 132 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
RANDOM walk for 1510 steps (1 resets) in 4 ms. (302 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 301 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
[2024-06-01 02:01:30] [INFO ] Invariant cache hit.
[2024-06-01 02:01:30] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:30] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:30] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 02:01:30] [INFO ] Invariant cache hit.
[2024-06-01 02:01:30] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:30] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:30] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:30] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:01:30] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:30] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:01:30] [INFO ] Invariant cache hit.
[2024-06-01 02:01:30] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:01:30] [INFO ] Invariant cache hit.
[2024-06-01 02:01:30] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 02:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 128ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 128ms
Finished structural reductions in LTL mode , in 1 iterations and 173 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 211 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
RANDOM walk for 2368 steps (4 resets) in 7 ms. (296 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 11 factoid took 335 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
[2024-06-01 02:01:31] [INFO ] Invariant cache hit.
[2024-06-01 02:01:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:32] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:32] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:32] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 02:01:32] [INFO ] Invariant cache hit.
[2024-06-01 02:01:32] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:32] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:32] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:01:32] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:32] [INFO ] Added : 5 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4219 reset in 75 ms.
Product exploration explored 100000 steps with 4173 reset in 72 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:01:32] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 02:01:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 109ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 109ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 11/11 places, 8/8 transitions.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:01:32] [INFO ] Invariant cache hit.
[2024-06-01 02:01:32] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:01:32] [INFO ] Invariant cache hit.
[2024-06-01 02:01:32] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2024-06-01 02:01:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 7 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/11 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/19 variables, 11/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 22 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-04 finished in 3744 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 p1)||G(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(!p0) U (p1||(!p1 U 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' '!(X((G(F((G(F(p0))||(F(p0)&&G(!p1)))))||(F(!p0)&&X(F((G(F(p0))||(F(p0)&&G(!p1)))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-08
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 3 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2024-06-01 02:01:33] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:01:33] [INFO ] Implicit Places using invariants in 28 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/25 places, 7/18 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 1 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 1 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 02:01:33] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:01:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:01:33] [INFO ] Invariant cache hit.
[2024-06-01 02:01:33] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 78 ms. Remains : 7/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-08
Product exploration explored 100000 steps with 7325 reset in 51 ms.
Product exploration explored 100000 steps with 7134 reset in 61 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
RANDOM walk for 727 steps (0 resets) in 4 ms. (145 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 4 factoid took 117 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2024-06-01 02:01:34] [INFO ] Invariant cache hit.
[2024-06-01 02:01:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:34] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:34] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:34] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:01:34] [INFO ] Added : 3 causal constraints over 1 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:34] [INFO ] Invariant cache hit.
[2024-06-01 02:01:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:01:34] [INFO ] Invariant cache hit.
[2024-06-01 02:01:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
RANDOM walk for 660 steps (0 resets) in 4 ms. (132 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 146 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
[2024-06-01 02:01:35] [INFO ] Invariant cache hit.
[2024-06-01 02:01:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:01:35] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:01:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:01:35] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:01:35] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:01:35] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 7140 reset in 52 ms.
Product exploration explored 100000 steps with 7169 reset in 58 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 289 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0))]
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:36] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 7/7 places, 6/6 transitions.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:01:36] [INFO ] Invariant cache hit.
[2024-06-01 02:01:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:01:36] [INFO ] Invariant cache hit.
[2024-06-01 02:01:36] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Running 5 sub problems to find dead transitions.
[2024-06-01 02:01:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 9 constraints, problems are : Problem set: 0 solved, 5 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/13 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 14 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-08 finished in 3356 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 X((p1||X(G(p1)))))))))'
[2024-06-01 02:01:36] [INFO ] Flatten gal took : 10 ms
[2024-06-01 02:01:36] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 02:01:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 3 ms.
Total runtime 47392 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ClientsAndServers-PT-N0020P1-LTLFireability-04
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ClientsAndServers-PT-N0020P1-LTLFireability-12

BK_STOP 1717207319045

--------------------
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 ClientsAndServers-PT-N0020P1-LTLFireability-01
ltl formula formula --ltl=/tmp/3833/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 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 22 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~1073!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 456
pnml2lts-mc( 0/ 4): unique states count: 4547
pnml2lts-mc( 0/ 4): unique transitions count: 11048
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4558
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4102
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4558 states 11071 transitions, fanout: 2.429
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 65114, Transitions per second: 158157
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 28.1 B/state, compr.: 26.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-02
ltl formula formula --ltl=/tmp/3833/ltl_1_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_1_
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 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 21 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~1073!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 134
pnml2lts-mc( 0/ 4): unique states count: 4183
pnml2lts-mc( 0/ 4): unique transitions count: 10481
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1408
pnml2lts-mc( 0/ 4): - claim success count: 4195
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4061
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4195 states 10506 transitions, fanout: 2.504
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.050 sec minimum, 0.050 sec on average)
pnml2lts-mc( 0/ 4): States per second: 83900, Transitions per second: 210120
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 24.5 B/state, compr.: 23.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-03
ltl formula formula --ltl=/tmp/3833/ltl_2_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_2_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 23 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~1073!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 240
pnml2lts-mc( 0/ 4): unique states count: 3835
pnml2lts-mc( 0/ 4): unique transitions count: 17927
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 70
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3844
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3625
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3844 states 17948 transitions, fanout: 4.669
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64067, Transitions per second: 299133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 27.6 B/state, compr.: 26.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-04
ltl formula formula --ltl=/tmp/3833/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
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 25 places, 18 transitions and 54 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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 28 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): ~628 levels ~10000 states ~14320 transitions
pnml2lts-mc( 0/ 4): ~655 levels ~20000 states ~29000 transitions
pnml2lts-mc( 0/ 4): ~700 levels ~40000 states ~59392 transitions
pnml2lts-mc( 0/ 4): ~808 levels ~80000 states ~119312 transitions
pnml2lts-mc( 0/ 4): ~1052 levels ~160000 states ~240416 transitions
pnml2lts-mc( 0/ 4): ~1052 levels ~320000 states ~572900 transitions
pnml2lts-mc( 0/ 4): ~1052 levels ~640000 states ~1297168 transitions
pnml2lts-mc( 0/ 4): ~1052 levels ~1280000 states ~2756044 transitions
pnml2lts-mc( 0/ 4): ~1052 levels ~2560000 states ~5749764 transitions
pnml2lts-mc( 0/ 4): ~1052 levels ~5120000 states ~11815444 transitions
pnml2lts-mc( 2/ 4): ~1051 levels ~10240000 states ~28532404 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10671602
pnml2lts-mc( 0/ 4): unique states count: 10675369
pnml2lts-mc( 0/ 4): unique transitions count: 27393245
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 20164961
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12209594
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4210
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12209594 states 33872627 transitions, fanout: 2.774
pnml2lts-mc( 0/ 4): Total exploration time 12.020 sec (12.010 sec minimum, 12.015 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1015773, Transitions per second: 2818022
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 145.5MB, 14.3 B/state, compr.: 13.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 31.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 145.5MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-06
ltl formula formula --ltl=/tmp/3833/ltl_4_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_4_
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 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 48 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( 1/ 4): ~389 levels ~10000 states ~24152 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~1073!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4118
pnml2lts-mc( 0/ 4): unique states count: 6877
pnml2lts-mc( 0/ 4): unique transitions count: 18740
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 4289
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6888
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2809
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6888 states 18779 transitions, fanout: 2.726
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 98400, Transitions per second: 268271
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 25.5 B/state, compr.: 24.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-07
ltl formula formula --ltl=/tmp/3833/ltl_5_
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 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 44 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): ~201 levels ~10000 states ~15196 transitions
pnml2lts-mc( 0/ 4): ~201 levels ~20000 states ~30232 transitions
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: 11401
pnml2lts-mc( 0/ 4): unique states count: 11401
pnml2lts-mc( 0/ 4): unique transitions count: 16981
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12037
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 18661
pnml2lts-mc( 0/ 4): - cum. max stack depth: 804
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18661 states 33617 transitions, fanout: 1.801
pnml2lts-mc( 0/ 4): Total exploration time 0.110 sec (0.110 sec minimum, 0.110 sec on average)
pnml2lts-mc( 0/ 4): States per second: 169645, Transitions per second: 305609
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 17.1 B/state, compr.: 16.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-08
ltl formula formula --ltl=/tmp/3833/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_6_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 28 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): Accepting cycle FOUND at depth ~1073!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1004
pnml2lts-mc( 0/ 4): unique states count: 4697
pnml2lts-mc( 0/ 4): unique transitions count: 10718
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 155
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4708
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3704
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4708 states 10748 transitions, fanout: 2.283
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78467, Transitions per second: 179133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 27.6 B/state, compr.: 26.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P1-LTLFireability-12
ltl formula formula --ltl=/tmp/3833/ltl_7_
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 25 places, 18 transitions and 54 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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3833/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3833/ltl_7_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3833/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3833/ltl_7_
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 27 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 22 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( 3/ 4): ~239 levels ~10000 states ~15116 transitions
pnml2lts-mc( 3/ 4): ~239 levels ~20000 states ~30012 transitions
pnml2lts-mc( 3/ 4): ~239 levels ~40000 states ~60416 transitions
pnml2lts-mc( 2/ 4): ~240 levels ~80000 states ~156736 transitions
pnml2lts-mc( 2/ 4): ~240 levels ~160000 states ~316736 transitions
pnml2lts-mc( 2/ 4): ~240 levels ~320000 states ~636760 transitions
pnml2lts-mc( 2/ 4): ~268 levels ~640000 states ~1319268 transitions
pnml2lts-mc( 2/ 4): ~302 levels ~1280000 states ~2920344 transitions
pnml2lts-mc( 2/ 4): ~319 levels ~2560000 states ~6547928 transitions
pnml2lts-mc( 2/ 4): ~353 levels ~5120000 states ~13905912 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8700768
pnml2lts-mc( 0/ 4): unique states count: 8702660
pnml2lts-mc( 0/ 4): unique transitions count: 21177413
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12684471
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8814715
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2085
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8814715 states 21557163 transitions, fanout: 2.446
pnml2lts-mc( 0/ 4): Total exploration time 8.240 sec (8.240 sec minimum, 8.240 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1069747, Transitions per second: 2616161
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 130.4MB, 15.7 B/state, compr.: 14.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 25.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 130.4MB (~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="ClientsAndServers-PT-N0020P1"
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 ClientsAndServers-PT-N0020P1, 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 r476-tall-171620505900452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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