Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r071-smll-167814397700243.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ClientsAndServers-PT-N0010P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397700243
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.0K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.1K Mar 5 18:22 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-N0010P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0010P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678259761987

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0010P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 07:16:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 07:16:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:16:06] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-08 07:16:06] [INFO ] Transformed 25 places.
[2023-03-08 07:16:06] [INFO ] Transformed 18 transitions.
[2023-03-08 07:16:06] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 14 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 07:16:06] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-08 07:16:06] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-08 07:16:06] [INFO ] Invariant cache hit.
[2023-03-08 07:16:06] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2023-03-08 07:16:06] [INFO ] Invariant cache hit.
[2023-03-08 07:16:06] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 452 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2023-03-08 07:16:07] [INFO ] Flatten gal took : 39 ms
[2023-03-08 07:16:07] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:16:07] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10008 steps, including 9 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 22) seen :20
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=11 )
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(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 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 3 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 07:16:07] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-08 07:16:08] [INFO ] Implicit Places using invariants in 74 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 76 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 2 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 81 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 492 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p1:(LEQ s17 s19), p0:(LEQ 3 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 439 ms.
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10009 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 114 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 148 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:16:09] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-08 07:16:09] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 07:16:09] [INFO ] Invariant cache hit.
[2023-03-08 07:16:10] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-08 07:16:10] [INFO ] Invariant cache hit.
[2023-03-08 07:16:10] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 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 : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 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)]
Incomplete random walk after 10014 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 267 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 199 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 119 ms.
Product exploration explored 100000 steps with 25000 reset in 239 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 21 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 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 17 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 17 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 17 transition count 14
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 16 transition count 13
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 21 rules in 31 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-08 07:16:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-08 07:16:12] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 07:16:12] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/21 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 16/21 places, 13/18 transitions.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:16:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:16:12] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 07:16:12] [INFO ] Invariant cache hit.
[2023-03-08 07:16:12] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 07:16:12] [INFO ] Invariant cache hit.
[2023-03-08 07:16:12] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-00 finished in 4668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||(F(G(p1)) U p0)))'
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
[2023-03-08 07:16:12] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 07:16:12] [INFO ] Implicit Places using invariants in 65 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 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 73 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 301 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s6), p1:(LEQ s0 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4 reset in 352 ms.
Product exploration explored 100000 steps with 5 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 941 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=313 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 07:16:14] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:16:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p0)
[2023-03-08 07:16:14] [INFO ] Invariant cache hit.
[2023-03-08 07:16:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 07:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:16:14] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 07:16:14] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 07:16:14] [INFO ] Added : 9 causal constraints over 2 iterations in 43 ms. Result :sat
Could not prove EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND p1 (NOT p0))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-01 finished in 2615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(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 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.
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 8 rules applied. Total rules applied 16 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 12 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 07:16:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:16:15] [INFO ] Implicit Places using invariants in 44 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2023-03-08 07:16:15] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 07:16:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 07:16:15] [INFO ] Invariant cache hit.
[2023-03-08 07:16:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/24 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 6/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1830 reset in 174 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-02 finished in 431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((G(p1)||(F(p2) U p3)))))'
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 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 07:16:15] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 07:16:15] [INFO ] Implicit Places using invariants in 92 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 1149 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=true, acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p3 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(NOT p0), acceptance={} source=5 dest: 14}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 12}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=9 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={1} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 15}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(NOT p3), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=13 dest: 12}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=13 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=14 dest: 12}, { cond=p0, acceptance={} source=14 dest: 14}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=16 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=16 dest: 15}, { cond=(AND p3 (NOT p2)), acceptance={} source=16 dest: 16}]], initial=0, aps=[p1:(AND (LEQ 3 s16) (LEQ s13 s8)), p3:(LEQ s9 s12), p2:(LEQ s13 s8), p0:(GT 3 s16)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33327 reset in 272 ms.
Product exploration explored 100000 steps with 33259 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 46 factoid took 6074 ms. Reduced automaton from 17 states, 71 edges and 4 AP (stutter sensitive) to 14 states, 72 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 916 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3))]
Incomplete random walk after 10008 steps, including 6 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 26) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 23) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:16:25] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 07:16:25] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:6
[2023-03-08 07:16:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:16:25] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 07:16:25] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :6
[2023-03-08 07:16:25] [INFO ] After 94ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :6
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-08 07:16:25] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :6
Fused 13 Parikh solutions to 5 different solutions.
Finished Parikh walk after 291 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=36 )
Parikh walk visited 6 properties in 13 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (G (NOT (AND p1 (NOT p3) (NOT p2)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (G (NOT (AND p1 p3 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p3))), (F (AND p3 (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (NOT p0)), (F (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p3 (NOT p2)))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (OR (AND p0 (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) p3 (NOT p2))), (F (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))]
Knowledge based reduction with 53 factoid took 9408 ms. Reduced automaton from 14 states, 72 edges and 4 AP (stutter insensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 683 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 763 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Support contains 5 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 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:16:36] [INFO ] Invariant cache hit.
[2023-03-08 07:16:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 07:16:36] [INFO ] Invariant cache hit.
[2023-03-08 07:16:36] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 07:16:36] [INFO ] Invariant cache hit.
[2023-03-08 07:16:36] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 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 p2 p3 p0 (NOT p1)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p2), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 2706 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 670 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Incomplete random walk after 10014 steps, including 10 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 13) seen :3
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:16:40] [INFO ] Invariant cache hit.
[2023-03-08 07:16:40] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:16:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-08 07:16:40] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-08 07:16:40] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:16:40] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 07:16:40] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 298 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=42 )
Parikh walk visited 4 properties in 9 ms.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p2), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p3) p1)), (F (AND p3 (NOT p2))), (F (NOT p2)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p0))), (F (AND p3 (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p3 (NOT p2) p0)), (F (AND (NOT p3) (NOT p2) p0)), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0)), (F (NOT p3)), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 26 factoid took 3450 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 676 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 675 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 774 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Product exploration explored 100000 steps with 3776 reset in 258 ms.
Product exploration explored 100000 steps with 3805 reset in 276 ms.
Applying partial POR strategy [false, true, true, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 789 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3)))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 20 transition count 17
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 20 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 20 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 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 7 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2023-03-08 07:16:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2023-03-08 07:16:47] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:16:47] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/21 places, 16/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 19/21 places, 16/18 transitions.
Support contains 5 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
[2023-03-08 07:16:47] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:16:47] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 07:16:47] [INFO ] Invariant cache hit.
[2023-03-08 07:16:47] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-08 07:16:47] [INFO ] Invariant cache hit.
[2023-03-08 07:16:47] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-06 finished in 32387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 2 places :
Implicit places reduction removed 2 places
Drop transitions 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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
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
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 23 place count 11 transition count 8
Applied a total of 23 rules in 6 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 07:16:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:16:48] [INFO ] Implicit Places using invariants in 43 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/24 places, 8/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 9 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 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 3 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-08 07:16:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 07:16:48] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 07:16:48] [INFO ] Invariant cache hit.
[2023-03-08 07:16:48] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/24 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10 reset in 124 ms.
Stack based approach found an accepted trace after 49 steps with 0 reset with depth 50 and stack size 50 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-07 finished in 318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(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 3 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:16:48] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:16:48] [INFO ] Implicit Places using invariants in 47 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 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 179 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 1 s11), p1:(GT s0 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-08 finished in 255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
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.
[2023-03-08 07:16:48] [INFO ] Invariant cache hit.
[2023-03-08 07:16:48] [INFO ] Implicit Places using invariants in 48 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 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 53 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ 3 s13) (AND (LEQ 3 s12) (LEQ 3 s4)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1087 reset in 196 ms.
Product exploration explored 100000 steps with 1134 reset in 227 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 149 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 144 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=72 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 177 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 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 07:16:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:16:49] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:16:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:16:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 07:16:49] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 07:16:49] [INFO ] Added : 9 causal constraints over 2 iterations in 33 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 20 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 16 place count 12 transition count 7
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 22 place count 9 transition count 7
Applied a total of 22 rules in 8 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 07:16:49] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:16:49] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-08 07:16:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:16:49] [INFO ] Invariant cache hit.
[2023-03-08 07:16:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
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 127 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 49 ms :[(NOT p0)]
Finished random walk after 42 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=42 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 179 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 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-08 07:16:50] [INFO ] Invariant cache hit.
[2023-03-08 07:16:50] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:16:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 07:16:50] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:16:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:16:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 07:16:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:16:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 07:16:50] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:16:50] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2972 reset in 157 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-10 finished in 2191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((F(!p0)&&F(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 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 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 07:16:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 07:16:50] [INFO ] Implicit Places using invariants in 56 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 57 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s19 s7), p1:(AND (GT 1 s4) (GT s19 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 927 reset in 227 ms.
Product exploration explored 100000 steps with 923 reset in 269 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 286 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Finished random walk after 586 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=586 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 10
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 18 place count 12 transition count 7
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 22 place count 10 transition count 7
Applied a total of 22 rules in 6 ms. Remains 10 /21 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 07:16:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:16:52] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 07:16:52] [INFO ] Invariant cache hit.
[2023-03-08 07:16:52] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 07:16:52] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:16:52] [INFO ] Invariant cache hit.
[2023-03-08 07:16:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 122 ms. Remains : 10/21 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 (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 403 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Finished random walk after 229 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=114 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 501 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 151 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 153 ms :[false, (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 8550 reset in 176 ms.
Stack based approach found an accepted trace after 907 steps with 84 reset with depth 178 and stack size 178 in 4 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-11 finished in 3803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0))||F(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 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:16:54] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:16:54] [INFO ] Implicit Places using invariants in 49 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 51 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}]], initial=0, aps=[p1:(LEQ s12 s20), p0:(LEQ 1 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 100 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-12 finished in 600 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0 U (p1||G(p0))))&&(p2||F(G(p3))))))'
Support contains 6 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.
[2023-03-08 07:16:55] [INFO ] Invariant cache hit.
[2023-03-08 07:16:55] [INFO ] Implicit Places using invariants in 30 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 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 33 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p2) p3)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p2 p3), acceptance={1} source=1 dest: 3}, { cond=(AND p0 p2 (NOT p3)), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p3 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s8), p2:(GT s12 s1), p3:(GT 1 s5), p1:(LEQ s14 s17)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 397 reset in 176 ms.
Product exploration explored 100000 steps with 404 reset in 303 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 15 factoid took 1572 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10002 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :11
Finished Best-First random walk after 173 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p3 (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND p0 p2 p3)), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p2 (NOT p3))), (F p0), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p3) (NOT p1))), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 15 factoid took 1794 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 07:17:00] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-08 07:17:00] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:17:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 07:17:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:17:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 07:17:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:00] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 07:17:00] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:17:00] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:17:00] [INFO ] Invariant cache hit.
[2023-03-08 07:17:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 07:17:00] [INFO ] Invariant cache hit.
[2023-03-08 07:17:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 07:17:00] [INFO ] Invariant cache hit.
[2023-03-08 07:17:00] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 15 factoid took 1826 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10002 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :11
Finished Best-First random walk after 155 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=155 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3))), (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT p0)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))))), (X (X (NOT (AND p0 p2 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p3 (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (AND p0 p3 (NOT p1)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p3 (NOT p1)))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND p0 p2 p3)), (F (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p2 (NOT p3))), (F p0), (F (NOT (OR (AND (NOT p0) p3) (AND (NOT p2) p3)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p3) (NOT p1))), (F (AND p0 p3 (NOT p1)))]
Knowledge based reduction with 15 factoid took 1719 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 4 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
[2023-03-08 07:17:04] [INFO ] Invariant cache hit.
[2023-03-08 07:17:04] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 07:17:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:17:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:04] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 07:17:04] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:17:04] [INFO ] Added : 9 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 418 reset in 279 ms.
Stack based approach found an accepted trace after 20006 steps with 80 reset with depth 92 and stack size 92 in 60 ms.
FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-14 finished in 10282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
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
[2023-03-08 07:17:05] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:17:05] [INFO ] Implicit Places using invariants in 39 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 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 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GT s10 s15), p0:(LEQ s10 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 251 ms.
Product exploration explored 100000 steps with 3 reset in 307 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Finished random walk after 1165 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=582 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 357 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:17:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:17:07] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 07:17:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:17:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2023-03-08 07:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:07] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-08 07:17:07] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:17:07] [INFO ] Added : 11 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:17:07] [INFO ] Invariant cache hit.
[2023-03-08 07:17:07] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 07:17:07] [INFO ] Invariant cache hit.
[2023-03-08 07:17:07] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-08 07:17:07] [INFO ] Invariant cache hit.
[2023-03-08 07:17:07] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 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 p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Finished random walk after 333 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=333 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), true, (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 346 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
[2023-03-08 07:17:08] [INFO ] Invariant cache hit.
[2023-03-08 07:17:08] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:08] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 07:17:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:17:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:17:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:17:09] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-08 07:17:09] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:17:09] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Product exploration explored 100000 steps with 5 reset in 250 ms.
Product exploration explored 100000 steps with 6 reset in 279 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 9 rules in 9 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:17:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:17:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:17:10] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 21/21 places, 18/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:17:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:17:10] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 07:17:10] [INFO ] Invariant cache hit.
[2023-03-08 07:17:10] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-08 07:17:10] [INFO ] Invariant cache hit.
[2023-03-08 07:17:10] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-15 finished in 4886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||X(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((G(p1)||(F(p2) U p3)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0010P0-LTLCardinality-06
Stuttering acceptance computed with spot in 1137 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3))]
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 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.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 19 transition count 14
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 13 place count 17 transition count 12
Applied a total of 13 rules in 6 ms. Remains 17 /24 variables (removed 7) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2023-03-08 07:17:11] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 07:17:11] [INFO ] Implicit Places using invariants in 42 ms returned [11, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/24 places, 12/18 transitions.
Drop transitions 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 15 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 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 2 with 2 rules applied. Total rules applied 4 place count 13 transition count 10
Applied a total of 4 rules in 4 ms. Remains 13 /15 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 07:17:11] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:17:11] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 07:17:11] [INFO ] Invariant cache hit.
[2023-03-08 07:17:11] [INFO ] Implicit Places using invariants and state equation in 38 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 : 13/24 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 126 ms. Remains : 13/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0010P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}, { cond=true, acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p3 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=2 dest: 11}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=3 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={1} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 10}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(NOT p0), acceptance={} source=5 dest: 14}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={1} source=7 dest: 7}, { cond=(AND p3 (NOT p2)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 10}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 12}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=9 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p3)), acceptance={1} source=9 dest: 9}], [{ cond=(NOT p2), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=11 dest: 15}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=11 dest: 16}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=12 dest: 10}, { cond=(NOT p3), acceptance={0, 1} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=13 dest: 12}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=13 dest: 13}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 10}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=14 dest: 12}, { cond=p0, acceptance={} source=14 dest: 14}, { cond=(AND p1 (NOT p3) (NOT p2) p0), acceptance={} source=14 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 10}, { cond=(AND p1 (NOT p2)), acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=16 dest: 10}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={} source=16 dest: 15}, { cond=(AND p3 (NOT p2)), acceptance={} source=16 dest: 16}]], initial=0, aps=[p1:(AND (LEQ 3 s11) (LEQ s8 s3)), p3:(LEQ s4 s7), p2:(LEQ s8 s3), p0:(GT 3 s11)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33393 reset in 231 ms.
Product exploration explored 100000 steps with 33369 reset in 258 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 46 factoid took 6224 ms. Reduced automaton from 17 states, 71 edges and 4 AP (stutter sensitive) to 14 states, 72 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 861 ms :[(AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) (NOT p2) p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p0) (NOT p1) p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p3))]
Incomplete random walk after 10014 steps, including 10 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 26) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :8
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 13) seen :4
Running SMT prover for 9 properties.
[2023-03-08 07:17:19] [INFO ] Invariant cache hit.
[2023-03-08 07:17:19] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:2
[2023-03-08 07:17:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 07:17:19] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 07:17:19] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :2
[2023-03-08 07:17:19] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 07:17:19] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :2
Fused 9 Parikh solutions to 2 different solutions.
Finished Parikh walk after 102 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=25 )
Parikh walk visited 2 properties in 3 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 p2 p0), (X (NOT (AND (NOT p1) p3 (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p3 (NOT p2)))), (X (NOT (AND p1 p3 (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p3 (NOT p2))))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) p0)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p3 (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2))))), (X (X (NOT (AND p3 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (G (NOT (AND p1 (NOT p3) (NOT p2)))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) p1 p3 (NOT p2)))), (G (NOT (AND p1 p3 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p3))), (F (AND p3 (NOT p2))), (F (AND (NOT p1) (NOT p3) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p2))), (F (NOT p3)), (F (NOT p0)), (F (OR (AND (NOT p0) p1 (NOT p2)) (AND (NOT p0) p3 (NOT p2)))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (OR (AND p0 (NOT p3) (NOT p2)) (AND p1 (NOT p3) (NOT p2)))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p3) (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) p3 (NOT p2))), (F (OR (AND p1 (NOT p2)) (AND p3 (NOT p2))))]
Knowledge based reduction with 53 factoid took 9133 ms. Reduced automaton from 14 states, 72 edges and 4 AP (stutter insensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 646 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 661 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) p3 (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 07:17:30] [INFO ] Invariant cache hit.
[2023-03-08 07:17:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 07:17:30] [INFO ] Invariant cache hit.
[2023-03-08 07:17:30] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-08 07:17:30] [INFO ] Invariant cache hit.
[2023-03-08 07:17:30] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 13/13 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 p2 p3 p0 (NOT p1)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p2), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 26 factoid took 2723 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 767 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Incomplete random walk after 10004 steps, including 10 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 13) seen :5
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 07:17:34] [INFO ] Invariant cache hit.
[2023-03-08 07:17:34] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 07:17:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 07:17:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 07:17:34] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 07:17:34] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 07:17:34] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 188 steps, including 1 resets, run visited all 4 properties in 7 ms. (steps per millisecond=26 )
Parikh walk visited 4 properties in 7 ms.
Knowledge obtained : [(AND p2 p3 p0 (NOT p1)), (X (NOT (AND (NOT p2) p3 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND p1 (NOT p3)))), (X p3), (X p2), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X p2)), (X (X (NOT (AND (NOT p2) p3 p0)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p2) p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p3) p1)), (F (AND p3 (NOT p2))), (F (NOT p2)), (F (AND (NOT p3) (NOT p0) (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p0))), (F (AND p3 (NOT p2) (NOT p0))), (F (NOT p0)), (F (AND p3 (NOT p2) p0)), (F (AND (NOT p3) (NOT p2) p0)), (F (AND (NOT p3) (NOT p0) p1)), (F (AND (NOT p3) p0)), (F (NOT p3)), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 26 factoid took 3291 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 647 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 661 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Stuttering acceptance computed with spot in 645 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0)]
Product exploration explored 100000 steps with 4531 reset in 344 ms.
Product exploration explored 100000 steps with 4489 reset in 415 ms.
Applying partial POR strategy [false, true, true, false, false, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 617 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (AND p3 (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (NOT p2), (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3)), (AND (NOT p2) (NOT p3) p0), (AND p1 (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3)))]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 07:17:41] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:17:41] [INFO ] Invariant cache hit.
[2023-03-08 07:17:41] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 13/13 places, 10/10 transitions.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 07:17:41] [INFO ] Invariant cache hit.
[2023-03-08 07:17:41] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 07:17:41] [INFO ] Invariant cache hit.
[2023-03-08 07:17:41] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 07:17:41] [INFO ] Invariant cache hit.
[2023-03-08 07:17:41] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 13/13 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N0010P0-LTLCardinality-06 finished in 31250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0)) U (p1&&X(G(p0))))))'
[2023-03-08 07:17:41] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:17:41] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 07:17:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 95902 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0010P0
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0010P0-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678259888419

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N0010P0-LTLCardinality-06
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N0010P0-LTLCardinality-06
lola: result : false
lola: markings : 711
lola: fired transitions : 810
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0010P0-LTLCardinality-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P0-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0010P0-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0010P0-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1800 10/32 ClientsAndServers-PT-N0010P0-LTLCardinality-15 1397942 m, 279588 m/sec, 4210570 t fired, .

Time elapsed: 5 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P0-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0010P0-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0010P0-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1800 17/32 ClientsAndServers-PT-N0010P0-LTLCardinality-15 2599995 m, 240410 m/sec, 8089800 t fired, .

Time elapsed: 10 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P0-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0010P0-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0010P0-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1800 25/32 ClientsAndServers-PT-N0010P0-LTLCardinality-15 3696984 m, 219397 m/sec, 11705816 t fired, .

Time elapsed: 15 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P0-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0010P0-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0010P0-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1800 31/32 ClientsAndServers-PT-N0010P0-LTLCardinality-15 4739847 m, 208572 m/sec, 15183557 t fired, .

Time elapsed: 20 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for ClientsAndServers-PT-N0010P0-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P0-LTLCardinality-06: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0010P0-LTLCardinality-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0010P0-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0010P0-LTLCardinality-00
lola: time limit : 3575 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0010P0-LTLCardinality-00
lola: result : true
lola: markings : 10
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0010P0-LTLCardinality-00: LTL true LTL model checker
ClientsAndServers-PT-N0010P0-LTLCardinality-06: LTL false LTL model checker
ClientsAndServers-PT-N0010P0-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 25 secs. Pages in use: 32

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-N0010P0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-N0010P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397700243"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0010P0.tgz
mv ClientsAndServers-PT-N0010P0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;