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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K 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 53K 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.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 23:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 23:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 22:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 22:59 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-N0020P3-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717207352209

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-N0020P3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:02:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:02:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:02:33] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2024-06-01 02:02:33] [INFO ] Transformed 25 places.
[2024-06-01 02:02:33] [INFO ] Transformed 18 transitions.
[2024-06-01 02:02:33] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 128 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 5 formulas.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 9 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:02:33] [INFO ] Computed 8 invariants in 6 ms
[2024-06-01 02:02:33] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-06-01 02:02:33] [INFO ] Invariant cache hit.
[2024-06-01 02:02:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:02:33] [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 280 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 211 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 517ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 532ms
Finished structural reductions in LTL mode , in 1 iterations and 779 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2024-06-01 02:02:34] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:02:34] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:02:34] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 3859 steps (0 resets) in 37 ms. (101 steps per ms) remains 0/14 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' '!(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 20 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:02:35] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:35] [INFO ] Implicit Places using invariants in 28 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 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 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 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 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:02:35] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:02:35] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:02:35] [INFO ] Invariant cache hit.
[2024-06-01 02:02:35] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 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 112 ms. Remains : 5/25 places, 4/18 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-00
Product exploration explored 100000 steps with 13067 reset in 235 ms.
Product exploration explored 100000 steps with 13950 reset in 139 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 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 104 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:02:36] [INFO ] Invariant cache hit.
[2024-06-01 02:02:36] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:02:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:36] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:02:36] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:02:36] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 02:02:36] [INFO ] Invariant cache hit.
[2024-06-01 02:02:36] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:02:36] [INFO ] Invariant cache hit.
[2024-06-01 02:02:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 02:02:36] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 02:02:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 85ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 139 ms. Remains : 5/5 places, 4/4 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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 92 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 128 steps (0 resets) in 10 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 124 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 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:02:37] [INFO ] Invariant cache hit.
[2024-06-01 02:02:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:02:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:02:37] [INFO ] Computed and/alt/rep : 3/3/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:37] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12937 reset in 89 ms.
Product exploration explored 100000 steps with 13094 reset in 82 ms.
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 02:02:37] [INFO ] Invariant cache hit.
[2024-06-01 02:02:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 02:02:37] [INFO ] Invariant cache hit.
[2024-06-01 02:02:37] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 02:02:37] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 02:02:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 5/5 places, 4/4 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-00 finished in 2452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((p1||G((G(p2) U (p3 U p4)))))))'
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 4 rules applied. Total rules applied 4 place count 24 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Applied a total of 7 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 15/18 (removed 3) transitions.
// Phase 1: matrix 15 rows 21 cols
[2024-06-01 02:02:37] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 02:02:37] [INFO ] Implicit Places using invariants in 29 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/25 places, 15/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 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 14
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 19 transition count 13
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 18 transition count 13
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 6 place count 17 transition count 12
Applied a total of 6 rules in 8 ms. Remains 17 /20 variables (removed 3) and now considering 12/15 (removed 3) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-06-01 02:02:37] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 02:02:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 02:02:37] [INFO ] Invariant cache hit.
[2024-06-01 02:02:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/25 places, 12/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 94 ms. Remains : 17/25 places, 12/18 transitions.
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p4))), (NOT p0), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-02
Product exploration explored 100000 steps with 10221 reset in 172 ms.
Product exploration explored 100000 steps with 10315 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p4) (NOT p3) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT p3)), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p4)), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 168 ms. Reduced automaton from 7 states, 31 edges and 5 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 625 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
RANDOM walk for 37958 steps (12 resets) in 127 ms. (296 steps per ms) remains 0/20 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p4) (NOT p3) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT p3)), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p4)), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X p0), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p4))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p4 (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p4) p2))), (F (NOT (OR (NOT p1) p4 p3 p2))), (F (NOT (OR (NOT p1) (NOT p4) p3 (NOT p2)))), (F p4), (F (NOT (OR (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) p4 (NOT p3) p2))), (F (NOT (OR (NOT p1) (NOT p4) (NOT p3) p2))), (F (NOT (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (NOT (OR p1 p4 (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p4) p3 p2))), (F p1), (F (NOT p2)), (F (NOT (AND (OR p1 (NOT p4) (NOT p2)) (OR p1 (NOT p3) (NOT p2))))), (F (NOT (OR p1 p4 (NOT p3) p2))), (F p3), (F (NOT (AND (NOT p1) (NOT p4) (NOT p3) p2))), (F (NOT (OR p1 p4 p3 p2))), (F (NOT (AND (OR p1 (NOT p4) p2) (OR p1 (NOT p3) p2)))), (F (NOT (OR (NOT p1) p4 p3 (NOT p2))))]
Knowledge based reduction with 27 factoid took 1031 ms. Reduced automaton from 14 states, 53 edges and 4 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 663 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 583 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
[2024-06-01 02:02:41] [INFO ] Invariant cache hit.
[2024-06-01 02:02:41] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:41] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 2 ms returned sat
[2024-06-01 02:02:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:02:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2024-06-01 02:02:41] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 7 ms returned sat
[2024-06-01 02:02:41] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:02:41] [INFO ] Computed and/alt/rep : 11/14/11 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:41] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p4))
Support contains 6 out of 17 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 : 17/17 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2024-06-01 02:02:41] [INFO ] Invariant cache hit.
[2024-06-01 02:02:41] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:02:41] [INFO ] Invariant cache hit.
[2024-06-01 02:02:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 02:02:41] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 02:02:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 23 constraints, problems are : Problem set: 0 solved, 11 unsolved in 91 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 12/29 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 11/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/29 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 34 constraints, problems are : Problem set: 0 solved, 11 unsolved in 85 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 185ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 186ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 17/17 places, 12/12 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 p4) (NOT p3) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p4)), (X (NOT (AND p1 p4 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (AND p1 (NOT p4) p3 p2))), (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (NOT (AND p1 p4 p3 (NOT p2)))), (X (NOT (AND p1 p4 p3 p2))), (X (NOT (AND p1 p4 (NOT p3) p2))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p4))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (AND p1 (NOT p4) p3 p2)))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (NOT (AND p1 p4 p3 (NOT p2))))), (X (X (NOT (AND p1 p4 p3 p2)))), (X (X (NOT (AND p1 p4 (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 41 factoid took 114 ms. Reduced automaton from 14 states, 53 edges and 4 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 617 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
RANDOM walk for 40054 steps (16 resets) in 44 ms. (890 steps per ms) remains 1/20 properties
BEST_FIRST walk for 1027 steps (0 resets) in 7 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p4) (NOT p3) p2), (X p2), (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (X (NOT p3)), (X (NOT (AND p1 (NOT p4) p3 (NOT p2)))), (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2))), (X (NOT p4)), (X (NOT (AND p1 p4 (NOT p3) (NOT p2)))), (X (AND (NOT p1) (NOT p4) p2)), (X (NOT (AND p1 (NOT p4) p3 p2))), (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p4) (NOT p3) p2))), (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p4) p3 p2))), (X (NOT (AND p1 p4 p3 (NOT p2)))), (X (NOT (AND p1 p4 p3 p2))), (X (NOT (AND p1 p4 (NOT p3) p2))), (X (AND (NOT p1) (NOT p4) (NOT p3) p2)), (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2)))), (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p4) p3 (NOT p2))))), (X (X (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (X (X (NOT p4))), (X (X (NOT (AND p1 p4 (NOT p3) (NOT p2))))), (X (X (AND (NOT p1) (NOT p4) p2))), (X (X (NOT (AND p1 (NOT p4) p3 p2)))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p4) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) p4 (NOT p2)) (AND (NOT p1) p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 p2)))), (X (X (NOT (AND p1 p4 p3 (NOT p2))))), (X (X (NOT (AND p1 p4 p3 p2)))), (X (X (NOT (AND p1 p4 (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p4) (NOT p3) p2))), (X (X (NOT (AND (NOT p1) (NOT p4) p3 (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) p4 p2) (AND (NOT p1) p3 p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) p4 (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p4) p2))), (F (NOT (OR (NOT p1) p4 p3 p2))), (F (NOT (OR (NOT p1) (NOT p4) p3 (NOT p2)))), (F p4), (F (NOT (OR (NOT p1) p4 (NOT p3) p2))), (F (NOT (OR (NOT p1) (NOT p4) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p4) (NOT p3) p2))), (F (NOT (OR (AND (NOT p1) p4) (AND (NOT p1) p3) (AND (NOT p1) p2)))), (F (NOT (OR p1 p4 (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p4) p3 p2))), (F p1), (F (NOT p2)), (F (NOT (AND (OR p1 (NOT p4) (NOT p2)) (OR p1 (NOT p3) (NOT p2))))), (F (NOT (OR p1 p4 (NOT p3) p2))), (F p3), (F (NOT (AND (NOT p1) (NOT p4) (NOT p3) p2))), (F (NOT (OR p1 p4 p3 p2))), (F (NOT (AND (OR p1 (NOT p4) p2) (OR p1 (NOT p3) p2)))), (F (NOT (OR (NOT p1) p4 p3 (NOT p2))))]
Knowledge based reduction with 41 factoid took 762 ms. Reduced automaton from 14 states, 53 edges and 4 AP (stutter insensitive) to 14 states, 53 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 621 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 644 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
[2024-06-01 02:02:44] [INFO ] Invariant cache hit.
[2024-06-01 02:02:44] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:44] [INFO ] [Real]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 02:02:44] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:02:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:44] [INFO ] [Nat]Absence check using 4 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 02:02:44] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:02:44] [INFO ] Computed and/alt/rep : 11/14/11 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:44] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p4))
Stuttering acceptance computed with spot in 777 ms :[(AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p2) (NOT p4)), false, false, false, false, false, false, false, false]
Product exploration explored 100000 steps with 10191 reset in 162 ms.
Product exploration explored 100000 steps with 10196 reset in 146 ms.
Support contains 6 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 12/12 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 17 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 16 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 16 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 13 transition count 9
Applied a total of 7 rules in 2 ms. Remains 13 /17 variables (removed 4) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 02:02:45] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:02:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 02:02:45] [INFO ] Invariant cache hit.
[2024-06-01 02:02:45] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 02:02:45] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
[2024-06-01 02:02:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 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/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 9/22 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 26 constraints, problems are : Problem set: 0 solved, 8 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 154ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/17 places, 9/12 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 13/17 places, 9/12 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-02 finished in 8525 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(G(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 2 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:02:46] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:46] [INFO ] Implicit Places using invariants in 24 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 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 27 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-03
Entered a terminal (fully accepting) state of product in 29 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-03 finished in 160 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(F(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 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:02:46] [INFO ] Invariant cache hit.
[2024-06-01 02:02:46] [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 : 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 30 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-05
Product exploration explored 100000 steps with 2231 reset in 84 ms.
Product exploration explored 100000 steps with 2208 reset in 87 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7362 steps (3 resets) in 10 ms. (669 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 92 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:02:46] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:02:46] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-05 finished in 861 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(F((G((!p0&&F(p1)))||(!p0&&F(p1)&&F(G(p2)))))))'
Support contains 4 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:02:47] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:47] [INFO ] Implicit Places using invariants in 27 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 30 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-06
Product exploration explored 100000 steps with 1201 reset in 90 ms.
Product exploration explored 100000 steps with 1206 reset in 110 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 (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
RANDOM walk for 5586 steps (1 resets) in 10 ms. (507 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 12 factoid took 474 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:02:48] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 02:02:48] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:02:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:48] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:02:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:48] [INFO ] Added : 14 causal constraints over 3 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 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:02:48] [INFO ] Invariant cache hit.
[2024-06-01 02:02:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:02:48] [INFO ] Invariant cache hit.
[2024-06-01 02:02:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:02:48] [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 152 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 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 307 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 p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 110 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
RANDOM walk for 8909 steps (4 resets) in 14 ms. (593 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F (NOT (OR (NOT p0) (NOT p2)))), (F p1)]
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
[2024-06-01 02:02:50] [INFO ] Invariant cache hit.
[2024-06-01 02:02:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 02:02:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 02:02:50] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:50] [INFO ] Added : 14 causal constraints over 3 iterations in 41 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 1204 reset in 100 ms.
Product exploration explored 100000 steps with 1220 reset in 117 ms.
Applying partial POR strategy [false, true, true, true, false]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p2) (NOT p1)), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2)))]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 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 5 place count 20 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 17 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 17 transition count 15
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 17 place count 17 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 16 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 16 transition count 14
Deduced a syphon composed of 7 places in 1 ms
Applied a total of 19 rules in 12 ms. Remains 16 /20 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-06-01 02:02:51] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-06-01 02:02:51] [INFO ] Computed 3 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/16 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 4 (OVERLAPS) 14/30 variables, 16/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 19 constraints, problems are : Problem set: 7 solved, 6 unsolved in 82 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/16 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 14/30 variables, 16/19 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 6/25 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 7 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 16/16 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 7 solved, 6 unsolved
Search for dead transitions found 7 dead transitions in 140ms
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 : 16/20 places, 7/18 transitions.
Graph (complete) has 14 edges and 16 vertex of which 9 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 9 /16 variables (removed 7) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/20 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 9/20 places, 7/18 transitions.
Support contains 4 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:02:51] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:02:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:02:51] [INFO ] Invariant cache hit.
[2024-06-01 02:02:51] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:02:51] [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 115 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 104 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 269 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-06 finished in 4652 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)||F(p1)))'
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 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:02:51] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:51] [INFO ] Implicit Places using invariants in 21 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.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:02:51] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 02:02:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 02:02:51] [INFO ] Invariant cache hit.
[2024-06-01 02:02:51] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 67 ms. Remains : 7/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 33 ms.
Product exploration explored 100000 steps with 50000 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 : [(AND (NOT p1) p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 34 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-07 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' '!((((F(p0) U p1)&&(G(!p1)||G(!p2))) U !p0))'
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 4 places :
Implicit places reduction removed 4 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 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 17 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 16 transition count 13
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 20 place count 13 transition count 10
Applied a total of 20 rules in 3 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-06-01 02:02:51] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:51] [INFO ] Implicit Places using invariants in 24 ms returned [12]
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 : 12/25 places, 10/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 29 ms. Remains : 12/25 places, 10/18 transitions.
Stuttering acceptance computed with spot in 205 ms :[p0, true, (NOT p1), p1, p2, (AND p1 p2), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-09
Entered a terminal (fully accepting) state of product in 12 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-09 finished in 254 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))||(p0 U X(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 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:02:52] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 02:02:52] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 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 37 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-11
Product exploration explored 100000 steps with 4483 reset in 60 ms.
Product exploration explored 100000 steps with 4574 reset in 66 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 (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 66 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1468 steps (0 resets) in 4 ms. (293 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 7 factoid took 107 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2024-06-01 02:02:52] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:02:52] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 02:02:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 02:02:52] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:52] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 20 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 : 20/20 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 14 place count 13 transition count 7
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 22 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 24 place count 8 transition count 6
Applied a total of 24 rules in 2 ms. Remains 8 /20 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:02:52] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:02:53] [INFO ] Implicit Places using invariants in 15 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/20 places, 6/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 19 ms. Remains : 7/20 places, 6/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), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 102 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 02:02:53] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:02:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:02:53] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:53] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:02:53] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:53] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 12136 reset in 54 ms.
Product exploration explored 100000 steps with 11445 reset in 70 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 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:02:53] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 02:02:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:02:53] [INFO ] Invariant cache hit.
[2024-06-01 02:02:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 02:02:53] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 02:02:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 53ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/7 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 ms. Remains : 5/7 places, 4/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-11 finished in 1604 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 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 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 16 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 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 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 3 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:02:53] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:02:53] [INFO ] Implicit Places using invariants in 22 ms returned [8]
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 : 11/25 places, 8/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 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 5
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 6 place count 8 transition count 5
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 8 cols
[2024-06-01 02:02:53] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:53] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:02:53] [INFO ] Invariant cache hit.
[2024-06-01 02:02:53] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 8/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-12
Product exploration explored 100000 steps with 13603 reset in 59 ms.
Product exploration explored 100000 steps with 13723 reset in 63 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 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 51 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 812 steps (0 resets) in 4 ms. (162 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:02:54] [INFO ] Invariant cache hit.
[2024-06-01 02:02:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:54] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:02:54] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:54] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:02:54] [INFO ] Invariant cache hit.
[2024-06-01 02:02:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 02:02:54] [INFO ] Invariant cache hit.
[2024-06-01 02:02:54] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-06-01 02:02:54] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:02:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 96ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 8/8 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 57 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 63 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 812 steps (0 resets) in 4 ms. (162 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 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 138 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:02:55] [INFO ] Invariant cache hit.
[2024-06-01 02:02:55] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:55] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:02:55] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:55] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13532 reset in 45 ms.
Product exploration explored 100000 steps with 13899 reset in 57 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:02:55] [INFO ] Invariant cache hit.
[2024-06-01 02:02:55] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:02:55] [INFO ] Invariant cache hit.
[2024-06-01 02:02:55] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 02:02:55] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:02:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 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/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 5/13 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 16 constraints, problems are : Problem set: 0 solved, 4 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 79ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 8/8 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-12 finished in 1644 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)||G(F((!p1||G(p2)))))))'
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:02:55] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:02:55] [INFO ] Implicit Places using invariants in 37 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 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 39 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-13
Product exploration explored 100000 steps with 313 reset in 111 ms.
Product exploration explored 100000 steps with 321 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 266 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
RANDOM walk for 3800 steps (0 resets) in 6 ms. (542 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) (NOT p1))))]
Knowledge based reduction with 8 factoid took 420 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
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 6 rules applied. Total rules applied 6 place count 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 14 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 13 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 12 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 20 place count 10 transition count 8
Applied a total of 20 rules in 1 ms. Remains 10 /20 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-06-01 02:02:56] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:02:56] [INFO ] Implicit Places using invariants in 18 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/20 places, 8/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 20 ms. Remains : 9/20 places, 8/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 p0 (NOT p2) p1), (X p2), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Knowledge based reduction with 10 factoid took 261 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
RANDOM walk for 4208 steps (4 resets) in 8 ms. (467 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p2), (X (AND p2 p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (F (NOT p0)), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 10 factoid took 430 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 93 reset in 78 ms.
Stuttering criterion allowed to conclude after 14603 steps with 7 reset in 12 ms.
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-13 finished in 2717 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' '!(((!p0&&F(p1)) U (p0||X(G(p1)))))'
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 2 places :
Implicit places reduction removed 2 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 4 rules applied. Total rules applied 4 place count 23 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 7 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 20 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 16 transition count 11
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 3 with 2 rules applied. Total rules applied 18 place count 15 transition count 10
Applied a total of 18 rules in 4 ms. Remains 15 /25 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 15 cols
[2024-06-01 02:02:58] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 02:02:58] [INFO ] Implicit Places using invariants in 21 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/25 places, 10/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 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
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 13 transition count 8
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 12 transition count 8
Applied a total of 4 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 02:02:58] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:02:58] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:02:58] [INFO ] Invariant cache hit.
[2024-06-01 02:02:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 73 ms. Remains : 12/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-15
Product exploration explored 100000 steps with 14071 reset in 65 ms.
Product exploration explored 100000 steps with 14041 reset in 65 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1843 steps (0 resets) in 4 ms. (368 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
[2024-06-01 02:02:59] [INFO ] Invariant cache hit.
[2024-06-01 02:02:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-01 02:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:02:59] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:02:59] [INFO ] Added : 1 causal constraints over 1 iterations in 2 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:02:59] [INFO ] Invariant cache hit.
[2024-06-01 02:02:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:02:59] [INFO ] Invariant cache hit.
[2024-06-01 02:02:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-01 02:02:59] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 02:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12/12 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/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 58 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 12/12 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 p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 2338 steps (1 resets) in 8 ms. (259 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 216 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
[2024-06-01 02:02:59] [INFO ] Invariant cache hit.
[2024-06-01 02:02:59] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 0 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:02:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2024-06-01 02:02:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 02:02:59] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:02:59] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 13945 reset in 58 ms.
Product exploration explored 100000 steps with 14072 reset in 78 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:03:00] [INFO ] Invariant cache hit.
[2024-06-01 02:03:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:03:00] [INFO ] Invariant cache hit.
[2024-06-01 02:03:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 02:03:00] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 02:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12/12 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/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 125ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 12/12 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-15 finished in 2362 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' '!((F(p0)&&F((p1||G((G(p2) U (p3 U p4)))))))'
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(F((G((!p0&&F(p1)))||(!p0&&F(p1)&&F(G(p2)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P3-LTLFireability-06
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0)]
Support contains 4 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 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 9 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 12
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 16 place count 15 transition count 12
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 20 place count 13 transition count 10
Applied a total of 20 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-06-01 02:03:01] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:03:01] [INFO ] Implicit Places using invariants in 19 ms returned [9, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/25 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 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 4 place count 9 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 6 place count 8 transition count 7
Applied a total of 6 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 8 cols
[2024-06-01 02:03:01] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 02:03:01] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 02:03:01] [INFO ] Invariant cache hit.
[2024-06-01 02:03:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/25 places, 7/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 70 ms. Remains : 8/25 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-06
Product exploration explored 100000 steps with 5550 reset in 83 ms.
Stack based approach found an accepted trace after 11626 steps with 659 reset with depth 9 and stack size 9 in 18 ms.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-06 finished in 528 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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))||(p0 U X(G(p1)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P3-LTLFireability-11
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (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 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 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 22 place count 12 transition count 9
Applied a total of 22 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-06-01 02:03:01] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:03:01] [INFO ] Implicit Places using invariants in 21 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/25 places, 9/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 10 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 6
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 6 place count 7 transition count 6
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-06-01 02:03:01] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:03:01] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 02:03:01] [INFO ] Invariant cache hit.
[2024-06-01 02:03:01] [INFO ] Implicit Places using invariants and state equation in 23 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 : 7/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 65 ms. Remains : 7/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P3-LTLFireability-11
Product exploration explored 100000 steps with 7161 reset in 56 ms.
Product exploration explored 100000 steps with 8660 reset in 79 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 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 190 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 5 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:03:02] [INFO ] Invariant cache hit.
[2024-06-01 02:03:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:03:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:03:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:03:02] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:03:02] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 7 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 : 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:03:02] [INFO ] Invariant cache hit.
[2024-06-01 02:03:02] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 02:03:02] [INFO ] Invariant cache hit.
[2024-06-01 02:03:02] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 02:03:02] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:03:02] [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 28 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 33 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 66ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 66ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 86 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 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 168 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 138 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 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2024-06-01 02:03:02] [INFO ] Invariant cache hit.
[2024-06-01 02:03:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 02:03:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:03:02] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:02] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11843 reset in 55 ms.
Product exploration explored 100000 steps with 11972 reset in 80 ms.
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 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.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 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:03:03] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 02:03:03] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:03:03] [INFO ] Invariant cache hit.
[2024-06-01 02:03:03] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-06-01 02:03:03] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 02:03:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/9 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/7 places, 4/6 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 5/7 places, 4/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P3-LTLFireability-11 finished in 2046 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' '!(((!p0&&F(p1)) U (p0||X(G(p1)))))'
[2024-06-01 02:03:03] [INFO ] Flatten gal took : 5 ms
[2024-06-01 02:03:03] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-01 02:03:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 2 ms.
Total runtime 30180 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ClientsAndServers-PT-N0020P3-LTLFireability-00
Could not compute solution for formula : ClientsAndServers-PT-N0020P3-LTLFireability-02
FORMULA ClientsAndServers-PT-N0020P3-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ClientsAndServers-PT-N0020P3-LTLFireability-11
Could not compute solution for formula : ClientsAndServers-PT-N0020P3-LTLFireability-12
Could not compute solution for formula : ClientsAndServers-PT-N0020P3-LTLFireability-15

BK_STOP 1717207443535

--------------------
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-N0020P3-LTLFireability-00
ltl formula formula --ltl=/tmp/2668/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( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 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( 0/ 4): ~279 levels ~10000 states ~19348 transitions
pnml2lts-mc( 0/ 4): ~279 levels ~20000 states ~38692 transitions
pnml2lts-mc( 3/ 4): ~268 levels ~40000 states ~80920 transitions
pnml2lts-mc( 3/ 4): ~278 levels ~80000 states ~181584 transitions
pnml2lts-mc( 3/ 4): ~278 levels ~160000 states ~386592 transitions
pnml2lts-mc( 3/ 4): ~278 levels ~320000 states ~797584 transitions
pnml2lts-mc( 3/ 4): ~278 levels ~640000 states ~1616248 transitions
pnml2lts-mc( 2/ 4): ~282 levels ~1280000 states ~2764788 transitions
pnml2lts-mc( 2/ 4): ~282 levels ~2560000 states ~5939364 transitions
pnml2lts-mc( 2/ 4): ~314 levels ~5120000 states ~12247160 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~10240000 states ~27333056 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 14299642
pnml2lts-mc( 0/ 4): unique states count: 14536770
pnml2lts-mc( 0/ 4): unique transitions count: 43988025
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 28735531
pnml2lts-mc( 0/ 4): - claim found count: 484915
pnml2lts-mc( 0/ 4): - claim success count: 14745282
pnml2lts-mc( 0/ 4): - cum. max stack depth: 237256
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14745283 states 44983674 transitions, fanout: 3.051
pnml2lts-mc( 0/ 4): Total exploration time 14.180 sec (14.160 sec minimum, 14.175 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1039865, Transitions per second: 3172332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 177.6MB, 12.5 B/state, compr.: 11.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 44.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: 177.6MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P3-LTLFireability-02
ltl formula formula --ltl=/tmp/2668/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 26 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 122 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): ~402 levels ~10000 states ~42920 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~20000 states ~95276 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~40000 states ~202104 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~80000 states ~424328 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~160000 states ~879676 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~320000 states ~1813376 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~640000 states ~3687564 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~1280000 states ~7476960 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~2560000 states ~14224812 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~5120000 states ~24207256 transitions
pnml2lts-mc( 3/ 4): ~402 levels ~10240000 states ~39038600 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10809277
pnml2lts-mc( 0/ 4): unique states count: 10810460
pnml2lts-mc( 0/ 4): unique transitions count: 54146066
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 43333580
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 10810467
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1599
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10810467 states 54146095 transitions, fanout: 5.009
pnml2lts-mc( 0/ 4): Total exploration time 13.470 sec (13.440 sec minimum, 13.453 sec on average)
pnml2lts-mc( 0/ 4): States per second: 802559, Transitions per second: 4019755
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 146.5MB, 14.2 B/state, compr.: 13.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 32.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: 146.5MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P3-LTLFireability-06
ltl formula formula --ltl=/tmp/2668/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_2_
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/2668/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 26 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( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~1217!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2641
pnml2lts-mc( 0/ 4): unique states count: 6230
pnml2lts-mc( 0/ 4): unique transitions count: 13985
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 1830
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 6242
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3659
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6242 states 14016 transitions, fanout: 2.245
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: 89171, Transitions per second: 200229
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.1 B/state, compr.: 25.5%
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-N0020P3-LTLFireability-11
ltl formula formula --ltl=/tmp/2668/ltl_3_
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( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/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 26 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( 2/ 4): ~362 levels ~10000 states ~19744 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~20000 states ~42180 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~40000 states ~89372 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~80000 states ~187480 transitions
pnml2lts-mc( 0/ 4): ~1097 levels ~160000 states ~447068 transitions
pnml2lts-mc( 0/ 4): ~1097 levels ~320000 states ~930840 transitions
pnml2lts-mc( 0/ 4): ~1097 levels ~640000 states ~1916740 transitions
pnml2lts-mc( 0/ 4): ~1097 levels ~1280000 states ~3933132 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~2560000 states ~6832780 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~5120000 states ~13874168 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~10240000 states ~30030592 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13517333
pnml2lts-mc( 0/ 4): unique states count: 13894595
pnml2lts-mc( 0/ 4): unique transitions count: 47772134
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 31823394
pnml2lts-mc( 0/ 4): - claim found count: 843385
pnml2lts-mc( 0/ 4): - claim success count: 13909015
pnml2lts-mc( 0/ 4): - cum. max stack depth: 377523
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13909015 states 47844978 transitions, fanout: 3.440
pnml2lts-mc( 0/ 4): Total exploration time 13.590 sec (13.590 sec minimum, 13.590 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1023474, Transitions per second: 3520602
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 174.9MB, 12.6 B/state, compr.: 11.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 43.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: 174.9MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P3-LTLFireability-12
ltl formula formula --ltl=/tmp/2668/ltl_4_
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/2668/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2668/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_4_
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 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): ~402 levels ~10000 states ~20368 transitions
pnml2lts-mc( 1/ 4): ~402 levels ~20000 states ~43860 transitions
pnml2lts-mc( 1/ 4): ~402 levels ~40000 states ~92436 transitions
pnml2lts-mc( 1/ 4): ~402 levels ~80000 states ~194312 transitions
pnml2lts-mc( 1/ 4): ~402 levels ~160000 states ~403684 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~320000 states ~740316 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~640000 states ~1514248 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~1280000 states ~3171284 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~2560000 states ~6926960 transitions
pnml2lts-mc( 3/ 4): ~399 levels ~5120000 states ~14818432 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7912984
pnml2lts-mc( 0/ 4): unique states count: 7914173
pnml2lts-mc( 0/ 4): unique transitions count: 24077315
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 16161133
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7914192
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1602
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7914192 states 24077363 transitions, fanout: 3.042
pnml2lts-mc( 0/ 4): Total exploration time 7.820 sec (7.810 sec minimum, 7.812 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1012045, Transitions per second: 3078947
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 124.4MB, 16.5 B/state, compr.: 15.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.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: 124.4MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P3-LTLFireability-15
ltl formula formula --ltl=/tmp/2668/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( 2/ 4): LTL layer: formula: /tmp/2668/ltl_5_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2668/ltl_5_
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/2668/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2668/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 26 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 26, there are 40 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( 2/ 4): ~322 levels ~10000 states ~18180 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~20000 states ~38168 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~40000 states ~78420 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~80000 states ~171252 transitions
pnml2lts-mc( 3/ 4): ~319 levels ~160000 states ~367444 transitions
pnml2lts-mc( 3/ 4): ~319 levels ~320000 states ~744020 transitions
pnml2lts-mc( 3/ 4): ~319 levels ~640000 states ~1503700 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~1280000 states ~3162312 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~2560000 states ~6353004 transitions
pnml2lts-mc( 2/ 4): ~322 levels ~5120000 states ~12735952 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7992684
pnml2lts-mc( 0/ 4): unique states count: 7993390
pnml2lts-mc( 0/ 4): unique transitions count: 22000975
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 16200162
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8553098
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1282
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8553098 states 25170989 transitions, fanout: 2.943
pnml2lts-mc( 0/ 4): Total exploration time 8.320 sec (8.310 sec minimum, 8.312 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1028017, Transitions per second: 3025359
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 125.0MB, 16.4 B/state, compr.: 15.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 23.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: 125.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0020P3"
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-N0020P3, 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-171620505900468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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