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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 23:01 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-N0020P4-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717207385143

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-N0020P4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:03:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:03:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:03:06] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2024-06-01 02:03:06] [INFO ] Transformed 25 places.
[2024-06-01 02:03:06] [INFO ] Transformed 18 transitions.
[2024-06-01 02:03:06] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 15 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2024-06-01 02:03:06] [INFO ] Computed 7 invariants in 10 ms
[2024-06-01 02:03:06] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-01 02:03:06] [INFO ] Invariant cache hit.
[2024-06-01 02:03:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:03:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/42 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 31 constraints, problems are : Problem set: 0 solved, 17 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 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/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/24 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/42 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 48 constraints, problems are : Problem set: 0 solved, 17 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 533ms
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 764 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 22 out of 24 places after structural reductions.
[2024-06-01 02:03:07] [INFO ] Flatten gal took : 17 ms
[2024-06-01 02:03:07] [INFO ] Flatten gal took : 23 ms
[2024-06-01 02:03:07] [INFO ] Input system was already deterministic with 18 transitions.
RANDOM walk for 24497 steps (6 resets) in 176 ms. (138 steps per ms) remains 0/19 properties
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(G(p1)) U p2))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:03:08] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:08] [INFO ] Implicit Places using invariants in 35 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-00 finished in 545 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(!p0)&&F(!p1)) U (G(((X(!p0)&&F(!p1))||X(G(!p0))))||(G(p2)&&((X(!p0)&&F(!p1))||X(G(!p0))))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:03:08] [INFO ] Invariant cache hit.
[2024-06-01 02:03:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 02:03:08] [INFO ] Invariant cache hit.
[2024-06-01 02:03:08] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:03:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 398ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 399ms
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 338 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p1 p0), true, (AND (NOT p2) p0), p1, (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-01
Product exploration explored 100000 steps with 25002 reset in 294 ms.
Product exploration explored 100000 steps with 25058 reset in 151 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 p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 168 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 9 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 404 ms :[p0, p0, p0, (AND p0 (NOT p2)), (AND p1 p0), true, (AND (NOT p2) p0), p1, (AND (NOT p2) (NOT p0))]
RANDOM walk for 16077 steps (3 resets) in 60 ms. (263 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p0)))), (F (NOT (OR p2 p0))), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F p1), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p2 (NOT p0))))
Knowledge based reduction with 9 factoid took 378 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-01 finished in 2319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 18 transition count 13
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 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 10
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 18 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 21 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2024-06-01 02:03:11] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:11] [INFO ] Implicit Places using invariants in 22 ms returned [6, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 7/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 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 8 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 2 place count 8 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 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 02:03:11] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:11] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 02:03:11] [INFO ] Invariant cache hit.
[2024-06-01 02:03:11] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 85 ms. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-02
Product exploration explored 100000 steps with 15175 reset in 95 ms.
Product exploration explored 100000 steps with 15140 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
RANDOM walk for 332 steps (0 resets) in 4 ms. (66 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 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-06-01 02:03:11] [INFO ] Invariant cache hit.
[2024-06-01 02:03:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 02:03:11] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:03:11] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:03:11] [INFO ] Invariant cache hit.
[2024-06-01 02:03:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:03:11] [INFO ] Invariant cache hit.
[2024-06-01 02:03:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-06-01 02:03:11] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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 95ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 164 ms. Remains : 7/7 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 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 332 steps (0 resets) in 4 ms. (66 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 116 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-06-01 02:03:12] [INFO ] Invariant cache hit.
[2024-06-01 02:03:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:12] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:03:12] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:12] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15080 reset in 63 ms.
Product exploration explored 100000 steps with 15057 reset in 55 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-06-01 02:03:12] [INFO ] Invariant cache hit.
[2024-06-01 02:03:12] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 02:03:12] [INFO ] Invariant cache hit.
[2024-06-01 02:03:12] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 02:03:12] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 02:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/12 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 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, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/7 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/12 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 14 constraints, problems are : Problem set: 0 solved, 4 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 7/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 7/7 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-02 finished in 1551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p0&&X(X(X(F(p1)))))||G(F(p1)))))||(X(!p2)&&F(((!p0&&X(X(X(F(p1)))))||G(F(p1))))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 0 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2024-06-01 02:03:12] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 02:03:12] [INFO ] Implicit Places using invariants in 27 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 350 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-03
Product exploration explored 100000 steps with 33366 reset in 60 ms.
Product exploration explored 100000 steps with 33354 reset in 54 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 149 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4815 steps (1 resets) in 23 ms. (200 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 13 factoid took 150 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:03:13] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:03:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 02:03:13] [INFO ] Invariant cache hit.
[2024-06-01 02:03:13] [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.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:03:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 299ms
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 22/22 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 3518 steps (0 resets) in 11 ms. (293 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 49 ms.
Product exploration explored 100000 steps with 25000 reset in 56 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 18 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 18 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 18 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 17 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 17 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 20 rules in 13 ms. Remains 17 /22 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2024-06-01 02:03:15] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 17 cols
[2024-06-01 02:03:15] [INFO ] Computed 5 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 5 (OVERLAPS) 13/30 variables, 17/22 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/22 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 22 constraints, problems are : Problem set: 5 solved, 7 unsolved in 77 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/17 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/5 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 13/30 variables, 17/22 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 7/29 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/29 constraints. Problems are: Problem set: 5 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/29 constraints. Problems are: Problem set: 5 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 29 constraints, problems are : Problem set: 5 solved, 7 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 7/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 5 solved, 7 unsolved
Search for dead transitions found 5 dead transitions in 141ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/22 places, 8/18 transitions.
Graph (complete) has 20 edges and 17 vertex of which 12 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 10 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 10 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 6 rules in 5 ms. Remains 10 /17 variables (removed 7) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 165 ms. Remains : 10/22 places, 8/18 transitions.
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:03:15] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:15] [INFO ] Implicit Places using invariants in 23 ms returned [18, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 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 26 ms. Remains : 20/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-03 finished in 3288 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 U G(p1)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 12
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 14 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 14 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 4 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
Applied a total of 19 rules in 6 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-06-01 02:03:15] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:03:15] [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 SI_LTL mode, iteration 1 : 11/24 places, 10/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 11 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 10 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 10 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 9 transition count 8
Applied a total of 4 rules in 3 ms. Remains 9 /11 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 9 cols
[2024-06-01 02:03:15] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 02:03:15] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 02:03:15] [INFO ] Invariant cache hit.
[2024-06-01 02:03:15] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 70 ms. Remains : 9/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-04 finished in 186 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 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:03:16] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:16] [INFO ] Implicit Places using invariants in 36 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 40 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-05 finished in 183 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((p1&&X((p1 U (p0||G(p1))))))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:03:16] [INFO ] Invariant cache hit.
[2024-06-01 02:03:16] [INFO ] Implicit Places using invariants in 30 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 32 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-06
Entered a terminal (fully accepting) state of product in 46 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-06 finished in 185 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((((p0 U p1) U X(p1))||X((!p2 U p1))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:03:16] [INFO ] Invariant cache hit.
[2024-06-01 02:03:16] [INFO ] Implicit Places using invariants in 29 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 402 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-07
Entered a terminal (fully accepting) state of product in 11 steps with 2 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-07 finished in 456 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(((X(p1) U p2)&&G(p3)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:03:16] [INFO ] Invariant cache hit.
[2024-06-01 02:03:16] [INFO ] Implicit Places using invariants in 33 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 35 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-08
Product exploration explored 100000 steps with 1704 reset in 98 ms.
Product exploration explored 100000 steps with 1698 reset in 138 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 p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 115 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 3739 steps (0 resets) in 24 ms. (149 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR p2 (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F p3), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))), (F p0), (F (NOT (AND (NOT p3) (NOT p1))))]
Knowledge based reduction with 27 factoid took 609 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:03:18] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:03:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:18] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:03:18] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 02:03:18] [INFO ] Added : 10 causal constraints over 2 iterations in 51 ms. Result :sat
Could not prove EG (NOT p3)
[2024-06-01 02:03:18] [INFO ] Invariant cache hit.
[2024-06-01 02:03:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:03:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:18] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:03:18] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:18] [INFO ] Added : 9 causal constraints over 2 iterations in 8 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-06-01 02:03:18] [INFO ] Invariant cache hit.
[2024-06-01 02:03:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:03:18] [INFO ] Invariant cache hit.
[2024-06-01 02:03:18] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:03:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 298ms
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 140 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 4700 steps (1 resets) in 11 ms. (391 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR p2 (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F p3), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))), (F p0), (F (NOT (AND (NOT p3) (NOT p1))))]
Knowledge based reduction with 27 factoid took 533 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
[2024-06-01 02:03:20] [INFO ] Invariant cache hit.
[2024-06-01 02:03:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:03:20] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:20] [INFO ] Added : 10 causal constraints over 2 iterations in 45 ms. Result :sat
Could not prove EG (NOT p3)
[2024-06-01 02:03:20] [INFO ] Invariant cache hit.
[2024-06-01 02:03:20] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:20] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 02:03:20] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 02:03:20] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:20] [INFO ] Added : 9 causal constraints over 2 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 1696 reset in 100 ms.
Product exploration explored 100000 steps with 1695 reset in 132 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 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 3 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 8 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2024-06-01 02:03:21] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 19 cols
[2024-06-01 02:03:21] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
At refinement iteration 4 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 23 constraints, problems are : Problem set: 6 solved, 9 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 7/19 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 16/35 variables, 19/23 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 9/32 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/35 variables, 0/32 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 32 constraints, problems are : Problem set: 6 solved, 9 unsolved in 74 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 9/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 6 solved, 9 unsolved
Search for dead transitions found 6 dead transitions in 182ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 10/18 transitions.
Graph (complete) has 22 edges and 19 vertex of which 13 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 13 /19 variables (removed 6) and now considering 10/10 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/21 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 13/21 places, 10/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2024-06-01 02:03:21] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:03:21] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:03:21] [INFO ] Invariant cache hit.
[2024-06-01 02:03:21] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-06-01 02:03:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 285ms
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-08 finished in 5044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 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 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 12
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 14 place count 16 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 15 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 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 4 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 4 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-06-01 02:03:21] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 02:03:21] [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 : 11/24 places, 9/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 7
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 7
Applied a total of 4 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 02:03:21] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:03:21] [INFO ] Invariant cache hit.
[2024-06-01 02:03:22] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 64 ms. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-09
Stuttering criterion allowed to conclude after 62017 steps with 0 reset in 48 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-09 finished in 178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(!p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 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 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 6 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 02:03:22] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:03:22] [INFO ] Implicit Places using invariants in 25 ms returned [6, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 9 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 4 place count 8 transition count 6
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:03:22] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 02:03:22] [INFO ] Invariant cache hit.
[2024-06-01 02:03:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-12
Product exploration explored 100000 steps with 6231 reset in 60 ms.
Product exploration explored 100000 steps with 6878 reset in 143 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) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 93 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 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 496 steps (0 resets) in 8 ms. (55 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 313 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 65 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-06-01 02:03:23] [INFO ] Invariant cache hit.
[2024-06-01 02:03:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:23] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 02:03:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:23] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:03:23] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 02:03:23] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:03:23] [INFO ] Invariant cache hit.
[2024-06-01 02:03:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:03:23] [INFO ] Invariant cache hit.
[2024-06-01 02:03:23] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 02:03:23] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 158 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 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 70 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 496 steps (0 resets) in 4 ms. (99 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 225 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 56 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2024-06-01 02:03:23] [INFO ] Invariant cache hit.
[2024-06-01 02:03:23] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:23] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 02:03:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 02:03:23] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:23] [INFO ] Added : 1 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 5846 reset in 63 ms.
Product exploration explored 100000 steps with 7157 reset in 105 ms.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-06-01 02:03:24] [INFO ] Invariant cache hit.
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 02:03:24] [INFO ] Invariant cache hit.
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-06-01 02:03:24] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-06-01 02:03:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 162 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-12 finished in 2248 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 U X(G(p0))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 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 2 with 2 rules applied. Total rules applied 16 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 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 3 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2024-06-01 02:03:24] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants in 36 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 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 10 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 8 transition count 6
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 7 transition count 5
Applied a total of 6 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-06-01 02:03:24] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants in 24 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/24 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 68 ms. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-13
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-13 finished in 185 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&&(p1||G((F(!p0)&&F(p2)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 17 transition count 13
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 20 place count 13 transition count 9
Applied a total of 20 rules in 5 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-06-01 02:03:24] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants in 26 ms returned [9, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/24 places, 9/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 10 cols
[2024-06-01 02:03:24] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:03:24] [INFO ] Invariant cache hit.
[2024-06-01 02:03:24] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 10/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-14
Product exploration explored 100000 steps with 5655 reset in 69 ms.
Product exploration explored 100000 steps with 5680 reset in 74 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 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 (NOT p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 116 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
RANDOM walk for 7984 steps (2 resets) in 11 ms. (665 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 (NOT p1))), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 15 factoid took 362 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
Stuttering acceptance computed with spot in 179 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
[2024-06-01 02:03:26] [INFO ] Invariant cache hit.
[2024-06-01 02:03:26] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:03:26] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:26] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:26] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:03:26] [INFO ] Invariant cache hit.
[2024-06-01 02:03:26] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 02:03:26] [INFO ] Invariant cache hit.
[2024-06-01 02:03:26] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 02:03:26] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 02:03:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 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/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 160ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 160ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 220 ms. Remains : 10/10 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 p0 (NOT p2) p1), (X (NOT p2)), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 104 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
RANDOM walk for 5982 steps (1 resets) in 5 ms. (997 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (OR p0 p1))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 15 factoid took 315 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
Stuttering acceptance computed with spot in 138 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
[2024-06-01 02:03:27] [INFO ] Invariant cache hit.
[2024-06-01 02:03:27] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:27] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:27] [INFO ] Added : 4 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 154 ms :[(OR p0 (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (OR p0 (AND (NOT p1) (NOT p2))), p0]
Product exploration explored 100000 steps with 5692 reset in 82 ms.
Product exploration explored 100000 steps with 5655 reset in 88 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 02:03:27] [INFO ] Invariant cache hit.
[2024-06-01 02:03:27] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 02:03:27] [INFO ] Invariant cache hit.
[2024-06-01 02:03:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 02:03:27] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2024-06-01 02:03:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 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/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 126ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 10/10 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-14 finished in 3183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U (G(p1) U p2))||X(F(!p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-06-01 02:03:27] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:28] [INFO ] Implicit Places using invariants in 409 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 410 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 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 411 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-15
Product exploration explored 100000 steps with 8207 reset in 73 ms.
Product exploration explored 100000 steps with 8430 reset in 89 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 252 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 29224 steps (8 resets) in 28 ms. (1007 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 445 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 168 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 2 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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 13 transition count 8
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 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
Applied a total of 22 rules in 3 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 02:03:29] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:03:29] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 02:03:29] [INFO ] Invariant cache hit.
[2024-06-01 02:03:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-06-01 02:03:29] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 02:03:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 102ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/20 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 171 ms. Remains : 9/20 places, 7/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 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 126 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 11565 steps (6 resets) in 9 ms. (1156 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 315 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 155 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 167 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 15023 reset in 56 ms.
Product exploration explored 100000 steps with 15133 reset in 72 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:03:31] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 02:03:31] [INFO ] Implicit Places using invariants in 30 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 6/7 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 34 ms. Remains : 7/9 places, 6/7 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-15 finished in 3622 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))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((!p0&&X(X(X(F(p1)))))||G(F(p1)))))||(X(!p2)&&F(((!p0&&X(X(X(F(p1)))))||G(F(p1))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLFireability-03
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 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 23 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 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 20 transition count 13
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 11 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 13 place count 17 transition count 12
Applied a total of 13 rules in 2 ms. Remains 17 /24 variables (removed 7) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2024-06-01 02:03:31] [INFO ] Computed 6 invariants in 0 ms
[2024-06-01 02:03:31] [INFO ] Implicit Places using invariants in 19 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/24 places, 12/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 16 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 15 transition count 11
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 15 transition count 10
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 14 transition count 10
Applied a total of 4 rules in 1 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-06-01 02:03:31] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:31] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 02:03:31] [INFO ] Invariant cache hit.
[2024-06-01 02:03:31] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/24 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 93 ms. Remains : 14/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-03
Product exploration explored 100000 steps with 33347 reset in 46 ms.
Product exploration explored 100000 steps with 33278 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 p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 120 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 2057 steps (0 resets) in 7 ms. (257 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X p1), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p0) p2))), (X (NOT p0)), (X (X (NOT p2))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 02:03:32] [INFO ] Invariant cache hit.
[2024-06-01 02:03:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:03:32] [INFO ] Invariant cache hit.
[2024-06-01 02:03:32] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 02:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 174ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 174ms
Finished structural reductions in LTL mode , in 1 iterations and 227 ms. Remains : 14/14 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4131 steps (3 resets) in 5 ms. (688 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 334 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 74 ms.
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 12 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 12 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 7 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 10/10 (removed 0) transitions.
[2024-06-01 02:03:34] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 02:03:34] [INFO ] Computed 3 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 15 constraints, problems are : Problem set: 5 solved, 4 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 3/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 4/19 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 19 constraints, problems are : Problem set: 5 solved, 4 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 141ms problems are : Problem set: 5 solved, 4 unsolved
Search for dead transitions found 5 dead transitions in 141ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 5/10 transitions.
Graph (complete) has 12 edges and 12 vertex of which 7 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 7 /12 variables (removed 5) and now considering 5/5 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/14 places, 5/10 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 7/14 places, 5/10 transitions.
Support contains 1 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 02:03:34] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:34] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 02:03:34] [INFO ] Invariant cache hit.
[2024-06-01 02:03:34] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 02:03:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 15 constraints, problems are : Problem set: 0 solved, 9 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 9 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 137ms
Starting structural reductions in LTL mode, iteration 1 : 12/14 places, 10/10 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 12/14 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-03 finished in 3224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(((X(p1) U p2)&&G(p3)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P4-LTLFireability-08
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 3 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-06-01 02:03:34] [INFO ] Computed 5 invariants in 1 ms
[2024-06-01 02:03:34] [INFO ] Implicit Places using invariants in 22 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/24 places, 11/18 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 10
Applied a total of 2 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 13 cols
[2024-06-01 02:03:34] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 02:03:35] [INFO ] Implicit Places using invariants in 19 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 22 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 12/24 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 LI_LTL mode , in 3 iterations and 53 ms. Remains : 12/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-08
Product exploration explored 100000 steps with 3670 reset in 95 ms.
Product exploration explored 100000 steps with 3708 reset in 90 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 p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 192 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 4565 steps (5 resets) in 12 ms. (351 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (NOT (AND p3 (NOT p2) (NOT p0)))), (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1)))), (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p3 (NOT p0) (NOT p1)))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p0))), (X (AND (NOT p3) (NOT p1))), (X (AND (NOT p3) (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT p3))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p3 (NOT p2)) (AND (NOT p2) p1))))), (X (X (NOT (OR (AND p3 (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p0) p1))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p0) (NOT p1))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (AND (NOT p3) (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR p2 (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F p3), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))), (F p0), (F (NOT (AND (NOT p3) (NOT p1))))]
Knowledge based reduction with 27 factoid took 505 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
// Phase 1: matrix 10 rows 12 cols
[2024-06-01 02:03:36] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:36] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:36] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:36] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:36] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p3)
[2024-06-01 02:03:36] [INFO ] Invariant cache hit.
[2024-06-01 02:03:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:36] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 02:03:36] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:36] [INFO ] Added : 4 causal constraints over 1 iterations in 3 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 02:03:36] [INFO ] Invariant cache hit.
[2024-06-01 02:03:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 02:03:36] [INFO ] Invariant cache hit.
[2024-06-01 02:03:36] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 02:03:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 15 constraints, problems are : Problem set: 0 solved, 9 unsolved in 52 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 9 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 145ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 145ms
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 12/12 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 137 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
RANDOM walk for 2919 steps (1 resets) in 17 ms. (162 steps per ms) remains 0/13 properties
Knowledge obtained : [(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1)))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (AND (NOT p0) (NOT p3) (NOT p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT (AND p3 (NOT p1)))), (X (AND (NOT p3) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p1))))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND (NOT p2) p3) (AND (NOT p2) p1))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p3)))), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (NOT p3) p1))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (OR p0 (NOT p3) p1))), (F (NOT (AND (OR p2 (NOT p3)) (OR p2 (NOT p1))))), (F p1), (F (NOT (AND (NOT p0) (NOT p3)))), (F p2), (F p3), (F (NOT (AND (OR p0 p2 (NOT p3)) (OR p0 p2 (NOT p1))))), (F p0), (F (NOT (AND (NOT p3) (NOT p1))))]
Knowledge based reduction with 27 factoid took 530 ms. Reduced automaton from 4 states, 12 edges and 4 AP (stutter sensitive) to 4 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
[2024-06-01 02:03:37] [INFO ] Invariant cache hit.
[2024-06-01 02:03:37] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:03:37] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-06-01 02:03:37] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:37] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 02:03:37] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p3)
[2024-06-01 02:03:37] [INFO ] Invariant cache hit.
[2024-06-01 02:03:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 02:03:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 02:03:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 02:03:38] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 02:03:38] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 02:03:38] [INFO ] Added : 4 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Product exploration explored 100000 steps with 3689 reset in 71 ms.
Product exploration explored 100000 steps with 3670 reset in 80 ms.
Applying partial POR strategy [false, true, true, false]
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p3) (NOT p2)), (NOT p0), (AND (NOT p0) p3 (NOT p1)), (OR (NOT p2) (AND (NOT p1) (NOT p3)))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 02:03:38] [INFO ] Redundant transitions in 0 ms returned []
Running 9 sub problems to find dead transitions.
[2024-06-01 02:03:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 15 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 9 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-06-01 02:03:39] [INFO ] Invariant cache hit.
[2024-06-01 02:03:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 02:03:39] [INFO ] Invariant cache hit.
[2024-06-01 02:03:39] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-06-01 02:03:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 0/22 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 15 constraints, problems are : Problem set: 0 solved, 9 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 10/22 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/22 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 24 constraints, problems are : Problem set: 0 solved, 9 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 167ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 12/12 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-08 finished in 4566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(!p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&(p1||G((F(!p0)&&F(p2)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U (G(p1) U p2))||X(F(!p0))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLFireability-15
Stuttering acceptance computed with spot in 129 ms :[(AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p1))]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 19 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Applied a total of 16 rules in 3 ms. Remains 15 /24 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-06-01 02:03:39] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 02:03:39] [INFO ] Implicit Places using invariants in 24 ms returned [9, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 11/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 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 11 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 4 place count 11 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 6 place count 10 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 9 transition count 7
Applied a total of 8 rules in 1 ms. Remains 9 /13 variables (removed 4) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-06-01 02:03:39] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:39] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 02:03:39] [INFO ] Invariant cache hit.
[2024-06-01 02:03:39] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 9/24 places, 7/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 99 ms. Remains : 9/24 places, 7/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-15
Product exploration explored 100000 steps with 23030 reset in 67 ms.
Product exploration explored 100000 steps with 23300 reset in 67 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 235 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 13793 steps (7 resets) in 18 ms. (725 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (AND p1 p0)), (X p0), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 522 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 290 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 2 out of 9 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 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 02:03:41] [INFO ] Invariant cache hit.
[2024-06-01 02:03:41] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 02:03:41] [INFO ] Invariant cache hit.
[2024-06-01 02:03:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 02:03:41] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 02:03:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 114 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
RANDOM walk for 12879 steps (4 resets) in 12 ms. (990 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 13 factoid took 341 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 162 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 165 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 15172 reset in 72 ms.
Product exploration explored 100000 steps with 15129 reset in 70 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-06-01 02:03:42] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 02:03:42] [INFO ] Implicit Places using invariants in 21 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 6/7 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 27 ms. Remains : 7/9 places, 6/7 transitions.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-15 finished in 3363 ms.
[2024-06-01 02:03:42] [INFO ] Flatten gal took : 6 ms
[2024-06-01 02:03:42] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 02:03:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 28 ms.
Total runtime 36502 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : ClientsAndServers-PT-N0020P4-LTLFireability-02
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ClientsAndServers-PT-N0020P4-LTLFireability-08
Could not compute solution for formula : ClientsAndServers-PT-N0020P4-LTLFireability-12
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ClientsAndServers-PT-N0020P4-LTLFireability-15

BK_STOP 1717207475373

--------------------
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-N0020P4-LTLFireability-02
ltl formula formula --ltl=/tmp/2908/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 24 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2908/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2908/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2908/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2908/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 26 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 25, there are 20 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): ~322 levels ~10000 states ~20464 transitions
pnml2lts-mc( 3/ 4): ~322 levels ~20000 states ~41784 transitions
pnml2lts-mc( 3/ 4): ~322 levels ~40000 states ~86192 transitions
pnml2lts-mc( 3/ 4): ~322 levels ~80000 states ~177108 transitions
pnml2lts-mc( 3/ 4): ~322 levels ~160000 states ~363348 transitions
pnml2lts-mc( 1/ 4): ~318 levels ~320000 states ~751568 transitions
pnml2lts-mc( 3/ 4): ~322 levels ~640000 states ~1499608 transitions
pnml2lts-mc( 3/ 4): ~322 levels ~1280000 states ~3234092 transitions
pnml2lts-mc( 1/ 4): ~318 levels ~2560000 states ~6308744 transitions
pnml2lts-mc( 1/ 4): ~318 levels ~5120000 states ~12657812 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8019324
pnml2lts-mc( 0/ 4): unique states count: 8020174
pnml2lts-mc( 0/ 4): unique transitions count: 21766079
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 15716137
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8621616
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1281
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8621616 states 24976330 transitions, fanout: 2.897
pnml2lts-mc( 0/ 4): Total exploration time 15.700 sec (15.670 sec minimum, 15.685 sec on average)
pnml2lts-mc( 0/ 4): States per second: 549148, Transitions per second: 1590849
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 125.2MB, 16.4 B/state, compr.: 16.0%
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.2MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P4-LTLFireability-03
ltl formula formula --ltl=/tmp/2908/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
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2908/ltl_1_
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/2908/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2908/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2908/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 26 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 25, there are 36 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8
pnml2lts-mc( 0/ 4): unique states count: 8
pnml2lts-mc( 0/ 4): unique transitions count: 9
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 2
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 11
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11 states 22 transitions, fanout: 2.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 64.0 B/state, compr.: 62.7%
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.0MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P4-LTLFireability-08
ltl formula formula --ltl=/tmp/2908/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 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
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/2908/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2908/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2908/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2908/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 25, there are 42 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): ~619 levels ~10000 states ~16812 transitions
pnml2lts-mc( 2/ 4): ~637 levels ~20000 states ~32204 transitions
pnml2lts-mc( 2/ 4): ~691 levels ~40000 states ~62276 transitions
pnml2lts-mc( 2/ 4): ~799 levels ~80000 states ~122972 transitions
pnml2lts-mc( 2/ 4): ~1060 levels ~160000 states ~244792 transitions
pnml2lts-mc( 1/ 4): ~1251 levels ~320000 states ~633864 transitions
pnml2lts-mc( 1/ 4): ~1251 levels ~640000 states ~1286796 transitions
pnml2lts-mc( 1/ 4): ~1251 levels ~1280000 states ~2591056 transitions
pnml2lts-mc( 1/ 4): ~1251 levels ~2560000 states ~5175816 transitions
pnml2lts-mc( 1/ 4): ~1251 levels ~5120000 states ~10932664 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6774913
pnml2lts-mc( 0/ 4): unique states count: 6779102
pnml2lts-mc( 0/ 4): unique transitions count: 16421292
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 11110903
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7526664
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4999
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7526664 states 19448789 transitions, fanout: 2.584
pnml2lts-mc( 0/ 4): Total exploration time 11.940 sec (11.920 sec minimum, 11.930 sec on average)
pnml2lts-mc( 0/ 4): States per second: 630374, Transitions per second: 1628877
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.8MB, 17.9 B/state, compr.: 17.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.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: 115.8MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P4-LTLFireability-12
ltl formula formula --ltl=/tmp/2908/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2908/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2908/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2908/ltl_3_
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/2908/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 25, there are 27 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): ~354 levels ~10000 states ~23824 transitions
pnml2lts-mc( 3/ 4): ~354 levels ~20000 states ~46652 transitions
pnml2lts-mc( 3/ 4): ~354 levels ~40000 states ~93376 transitions
pnml2lts-mc( 3/ 4): ~354 levels ~80000 states ~190744 transitions
pnml2lts-mc( 3/ 4): ~354 levels ~160000 states ~391864 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~320000 states ~643904 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~640000 states ~1290564 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~1280000 states ~2819340 transitions
pnml2lts-mc( 0/ 4): ~357 levels ~2560000 states ~7431360 transitions
pnml2lts-mc( 0/ 4): ~357 levels ~5120000 states ~15286744 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7966875
pnml2lts-mc( 0/ 4): unique states count: 7967834
pnml2lts-mc( 0/ 4): unique transitions count: 24094731
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 16294960
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 8033973
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1434
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 8033973 states 24359814 transitions, fanout: 3.032
pnml2lts-mc( 0/ 4): Total exploration time 8.610 sec (8.600 sec minimum, 8.605 sec on average)
pnml2lts-mc( 0/ 4): States per second: 933098, Transitions per second: 2829247
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 124.8MB, 16.4 B/state, compr.: 16.1%
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.8MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P4-LTLFireability-14
ltl formula formula --ltl=/tmp/2908/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 24 places, 18 transitions and 52 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2908/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2908/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2908/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2908/ltl_4_
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 26 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 25, there are 29 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1289!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 3864
pnml2lts-mc( 0/ 4): unique transitions count: 11024
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3873
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3873
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3873 states 11043 transitions, fanout: 2.851
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64550, Transitions per second: 184050
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, 26.5 B/state, compr.: 26.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 18 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.3MB (~256.0MB paged-in)
ltl formula name ClientsAndServers-PT-N0020P4-LTLFireability-15
ltl formula formula --ltl=/tmp/2908/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
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 24 places, 18 transitions and 52 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/2908/ltl_5_
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/2908/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2908/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2908/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 25 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 25, there are 35 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): ~361 levels ~10000 states ~15096 transitions
pnml2lts-mc( 2/ 4): ~362 levels ~20000 states ~42348 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~40000 states ~75104 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~80000 states ~163720 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~160000 states ~345188 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~320000 states ~737116 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~640000 states ~1574660 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~1280000 states ~3272864 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~2560000 states ~6843840 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~5120000 states ~14174728 transitions
pnml2lts-mc( 1/ 4): ~361 levels ~10240000 states ~29178908 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8028588
pnml2lts-mc( 0/ 4): unique states count: 8029209
pnml2lts-mc( 0/ 4): unique transitions count: 23670799
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 26888372
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 12386169
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1446
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12386169 states 41433637 transitions, fanout: 3.345
pnml2lts-mc( 0/ 4): Total exploration time 13.930 sec (13.930 sec minimum, 13.930 sec on average)
pnml2lts-mc( 0/ 4): States per second: 889172, Transitions per second: 2974418
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 125.3MB, 16.4 B/state, compr.: 16.0%
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.3MB (~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-N0020P4"
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-N0020P4, 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-171620505900476"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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