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-167814397700236.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-N0005P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397700236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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.2K 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-N0005P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678259291687

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0005P1
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 07:08:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 07:08:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:08:15] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2023-03-08 07:08:15] [INFO ] Transformed 25 places.
[2023-03-08 07:08:15] [INFO ] Transformed 18 transitions.
[2023-03-08 07:08:15] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 32 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-08 07:08:16] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-08 07:08:16] [INFO ] Implicit Places using invariants in 239 ms returned []
[2023-03-08 07:08:16] [INFO ] Invariant cache hit.
[2023-03-08 07:08:16] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
[2023-03-08 07:08:16] [INFO ] Invariant cache hit.
[2023-03-08 07:08:16] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2023-03-08 07:08:16] [INFO ] Flatten gal took : 33 ms
[2023-03-08 07:08:16] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:08:16] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 975 steps, including 0 resets, run visited all 21 properties in 70 ms. (steps per millisecond=13 )
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' '!(F(G(((F(p1)&&p0) U X(X(p2))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 4 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 07:08:17] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 07:08:17] [INFO ] Implicit Places using invariants in 72 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 75 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 83 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 898 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=p0, acceptance={0} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 6}, { cond=(NOT p1), acceptance={} source=2 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s16 1)), p1:(GEQ s15 1), p2:(AND (GEQ s1 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2211 reset in 544 ms.
Product exploration explored 100000 steps with 2215 reset in 287 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 1492 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 649 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 344 steps, including 0 resets, run visited all 9 properties in 13 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 1763 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 608 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 603 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:24] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 07:08:24] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-08 07:08:24] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-08 07:08:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:24] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 07:08:24] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-08 07:08:24] [INFO ] Added : 13 causal constraints over 3 iterations in 78 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:08:24] [INFO ] Invariant cache hit.
[2023-03-08 07:08:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 07:08:24] [INFO ] Invariant cache hit.
[2023-03-08 07:08:25] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-08 07:08:25] [INFO ] Invariant cache hit.
[2023-03-08 07:08:25] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 1490 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 600 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Finished random walk after 718 steps, including 1 resets, run visited all 9 properties in 20 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F p0), (F p1), (F (AND p0 (NOT p1))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 1715 ms. Reduced automaton from 10 states, 30 edges and 3 AP (stutter sensitive) to 10 states, 30 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 616 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 585 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
[2023-03-08 07:08:30] [INFO ] Invariant cache hit.
[2023-03-08 07:08:30] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:30] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 07:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 07:08:30] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 07:08:30] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 600 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 2186 reset in 294 ms.
Product exploration explored 100000 steps with 2250 reset in 519 ms.
Applying partial POR strategy [false, false, true, false, false, false, true, false, true, true]
Stuttering acceptance computed with spot in 607 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 22 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 21 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 21 transition count 17
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 12 rules in 22 ms. Remains 21 /22 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-08 07:08:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2023-03-08 07:08:32] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-08 07:08:32] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 21/22 places, 17/18 transitions.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:32] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:08:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-08 07:08:32] [INFO ] Invariant cache hit.
[2023-03-08 07:08:32] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-08 07:08:32] [INFO ] Invariant cache hit.
[2023-03-08 07:08:32] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-00 finished in 15420 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 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
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 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 7 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 07:08:32] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:08:33] [INFO ] Implicit Places using invariants in 42 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 07:08:33] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:08:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 07:08:33] [INFO ] Invariant cache hit.
[2023-03-08 07:08:33] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 151 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s5 1) (AND (GEQ s3 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1401 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-01 finished in 226 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)&&F(p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 9 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 07:08:33] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 07:08:33] [INFO ] Implicit Places using invariants in 75 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/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 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 9 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 07:08:33] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 07:08:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 07:08:33] [INFO ] Invariant cache hit.
[2023-03-08 07:08:33] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 190 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, p0, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7456 reset in 185 ms.
Product exploration explored 100000 steps with 7470 reset in 280 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 169 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[true, p0, (NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[true, p0, (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[true, p0, (NOT p0)]
[2023-03-08 07:08:34] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[true, p0, (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 3 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 07:08:35] [INFO ] Invariant cache hit.
[2023-03-08 07:08:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 07:08:35] [INFO ] Invariant cache hit.
[2023-03-08 07:08:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 07:08:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:08:35] [INFO ] Invariant cache hit.
[2023-03-08 07:08:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 303 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[true, p0, (NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[true, p0, (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[true, p0, (NOT p0)]
[2023-03-08 07:08:36] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), true]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 3 states, 5 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[true, p0, (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[true, p0, (NOT p0)]
Product exploration explored 100000 steps with 7416 reset in 198 ms.
Stack based approach found an accepted trace after 7802 steps with 567 reset with depth 21 and stack size 21 in 29 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-02 finished in 3748 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((G(p0)||(p1 U p2)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 12 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 07:08:36] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants in 44 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Applied a total of 2 rules in 4 ms. Remains 9 /10 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 07:08:37] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 07:08:37] [INFO ] Invariant cache hit.
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p2:(AND (GEQ s5 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2698 reset in 217 ms.
Stuttering criterion allowed to conclude after 76758 steps with 2028 reset in 145 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-04 finished in 633 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' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
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 14
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 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 07:08:37] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants in 45 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 6 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 07:08:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 07:08:37] [INFO ] Invariant cache hit.
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LT s7 1), p1:(AND (GEQ s4 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-05 finished in 323 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((G(p0)||(p1&&F(p2)))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:37] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 07:08:37] [INFO ] Implicit Places using invariants in 46 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 405 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}]], initial=7, aps=[p2:(OR (LT s5 1) (LT s14 1)), p0:(AND (GEQ s4 1) (GEQ s18 1)), p1:(LT s6 1)], 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, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 252 ms.
Product exploration explored 100000 steps with 25000 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 317 steps, including 0 resets, run visited all 8 properties in 15 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 370 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 540 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 392 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
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:08:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:08:40] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 07:08:40] [INFO ] Invariant cache hit.
[2023-03-08 07:08:40] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-08 07:08:40] [INFO ] Invariant cache hit.
[2023-03-08 07:08:40] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 1105 steps, including 2 resets, run visited all 8 properties in 25 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p2 (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT p2)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p2) p0))]
Knowledge based reduction with 2 factoid took 369 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 385 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 380 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 135 ms.
Applying partial POR strategy [true, true, true, true, true, false, false, false]
Stuttering acceptance computed with spot in 410 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
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 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Performed 1 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 1 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 11 ms. Remains 16 /21 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-08 07:08:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 16 cols
[2023-03-08 07:08:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:08:43] [INFO ] Dead Transitions using invariants and state equation in 44 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 66 ms. Remains : 16/21 places, 13/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:08:43] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:08:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 07:08:43] [INFO ] Invariant cache hit.
[2023-03-08 07:08:44] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-08 07:08:44] [INFO ] Invariant cache hit.
[2023-03-08 07:08:44] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-06 finished in 6176 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||X(F((X(p1)&&G(p2))))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:44] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:08:44] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s19 1)), p2:(GEQ s10 1), p1:(LT s20 1)], 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 3691 reset in 195 ms.
Product exploration explored 100000 steps with 3668 reset in 220 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) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 1635 steps, including 2 resets, run visited all 4 properties in 9 ms. (steps per millisecond=181 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 4 factoid took 376 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:08:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:08:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:46] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 07:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:08:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-08 07:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 07:08:46] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 07:08:46] [INFO ] Added : 11 causal constraints over 3 iterations in 41 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 07:08:46] [INFO ] Invariant cache hit.
[2023-03-08 07:08:46] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 07:08:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:08:46] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:08:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:46] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 07:08:46] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:08:46] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:08:46] [INFO ] Invariant cache hit.
[2023-03-08 07:08:46] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 07:08:46] [INFO ] Invariant cache hit.
[2023-03-08 07:08:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 07:08:46] [INFO ] Invariant cache hit.
[2023-03-08 07:08:47] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 428 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 324 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-08 07:08:48] [INFO ] Invariant cache hit.
[2023-03-08 07:08:48] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 07:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:08:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:48] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-08 07:08:48] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-08 07:08:48] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 07:08:48] [INFO ] Invariant cache hit.
[2023-03-08 07:08:48] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:08:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:48] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 07:08:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:08:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:08:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 07:08:48] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 07:08:48] [INFO ] Added : 9 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 277 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3705 reset in 192 ms.
Product exploration explored 100000 steps with 3694 reset in 214 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:08:49] [INFO ] Invariant cache hit.
[2023-03-08 07:08:49] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 07:08:49] [INFO ] Invariant cache hit.
[2023-03-08 07:08:49] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2023-03-08 07:08:49] [INFO ] Invariant cache hit.
[2023-03-08 07:08:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-07 finished in 5662 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(p1)&&p0) U p2) U G(p3))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:08:49] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 07:08:49] [INFO ] Implicit Places using invariants in 42 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 328 ms :[(NOT p3), (NOT p3), true, (OR (NOT p2) (NOT p1)), (NOT p3), (OR (AND (NOT p1) p2 (NOT p3)) (AND p0 (NOT p1) (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p3 p2) (AND p3 p0)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p3 (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={} source=5 dest: 2}, { cond=(OR (AND p3 p2 (NOT p1)) (AND p3 p0 (NOT p1))), acceptance={} source=5 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s8 1) (GEQ s14 1)), p2:(GEQ s12 1), p0:(AND (GEQ s8 1) (GEQ s14 1)), p1:(OR (LT s12 1) (AND (GEQ s8 1) (GEQ s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-09 finished in 413 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(F((p0&&F(!p1)))))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:50] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 07:08:50] [INFO ] Implicit Places using invariants in 38 ms returned [14]
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/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 343 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s17 1)), p0:(OR (LT s8 1) (LT s14 1) (LT s1 1) (LT s17 1))], 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 96 ms.
Product exploration explored 100000 steps with 25000 reset in 136 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Finished random walk after 1606 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=200 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 217 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 254 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:08:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:08:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 07:08:51] [INFO ] Invariant cache hit.
[2023-03-08 07:08:52] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-08 07:08:52] [INFO ] Invariant cache hit.
[2023-03-08 07:08:52] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Finished random walk after 865 steps, including 1 resets, run visited all 3 properties in 11 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 251 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 260 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 25000 reset in 98 ms.
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 247 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 18 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 18 transition count 15
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 16 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 10 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-08 07:08:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-08 07:08:54] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:08:54] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61 ms. Remains : 17/21 places, 14/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:08:54] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:08:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 07:08:54] [INFO ] Invariant cache hit.
[2023-03-08 07:08:54] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-08 07:08:54] [INFO ] Invariant cache hit.
[2023-03-08 07:08:54] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-10 finished in 4157 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))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 11 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 07:08:54] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:08:54] [INFO ] Implicit Places using invariants in 38 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 7/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 53 ms. Remains : 9/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 25104 reset in 86 ms.
Product exploration explored 100000 steps with 25031 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 167 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)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 186 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 47 ms :[(NOT p0)]
// Phase 1: matrix 7 rows 9 cols
[2023-03-08 07:08:55] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 07:08:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:55] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 07:08:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:08:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:55] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 07:08:55] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:08:55] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 07:08:55] [INFO ] Invariant cache hit.
[2023-03-08 07:08:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 07:08:55] [INFO ] Invariant cache hit.
[2023-03-08 07:08:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 07:08:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:08:55] [INFO ] Invariant cache hit.
[2023-03-08 07:08:55] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 445 ms. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 311 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)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 186 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 46 ms :[(NOT p0)]
[2023-03-08 07:08:56] [INFO ] Invariant cache hit.
[2023-03-08 07:08:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:56] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 07:08:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:08:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 07:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:56] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 07:08:56] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:08:56] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24963 reset in 88 ms.
Product exploration explored 100000 steps with 24977 reset in 100 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 6 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 07:08:56] [INFO ] Invariant cache hit.
[2023-03-08 07:08:56] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 07:08:56] [INFO ] Invariant cache hit.
[2023-03-08 07:08:56] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-08 07:08:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:08:56] [INFO ] Invariant cache hit.
[2023-03-08 07:08:56] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 9/9 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-11 finished in 2536 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)||(p1&&(F(!p1)||p2)))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:56] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:08:56] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-08 07:08:56] [INFO ] Invariant cache hit.
[2023-03-08 07:08:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 07:08:56] [INFO ] Invariant cache hit.
[2023-03-08 07:08:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, p1, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s2 1) (GEQ s14 1)), p2:(OR (LT s4 1) (LT s19 1))], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-12 finished in 477 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 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 8 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 07:08:57] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 07:08:57] [INFO ] Implicit Places using invariants in 36 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/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 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 4 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 07:08:57] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 07:08:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 07:08:57] [INFO ] Invariant cache hit.
[2023-03-08 07:08:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 113 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-13 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:(AND (GEQ s1 1) (GEQ s7 1))], 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 7361 reset in 114 ms.
Product exploration explored 100000 steps with 7494 reset in 134 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 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
[2023-03-08 07:08:58] [INFO ] Invariant cache hit.
[2023-03-08 07:08:58] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 07:08:58] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 07:08:58] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 07:08:58] [INFO ] Invariant cache hit.
[2023-03-08 07:08:58] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 07:08:58] [INFO ] Invariant cache hit.
[2023-03-08 07:08:58] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 07:08:58] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:08:58] [INFO ] Invariant cache hit.
[2023-03-08 07:08:58] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 125 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 45 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=45 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
[2023-03-08 07:08:59] [INFO ] Invariant cache hit.
[2023-03-08 07:08:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 07:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:08:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 07:08:59] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:08:59] [INFO ] Added : 3 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7457 reset in 110 ms.
Product exploration explored 100000 steps with 7439 reset in 137 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 07:08:59] [INFO ] Invariant cache hit.
[2023-03-08 07:08:59] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 07:08:59] [INFO ] Invariant cache hit.
[2023-03-08 07:08:59] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 07:08:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:08:59] [INFO ] Invariant cache hit.
[2023-03-08 07:08:59] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-13 finished in 2509 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(!p0)||X(F(p1))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:08:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:08:59] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LT s4 1) (LT s18 1) (LT s10 1)), p0:(OR (LT s5 1) (LT s14 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-15 finished in 622 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(((F(p1)&&p0) U X(X(p2))))))'
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((G(p0)||(p1&&F(p2)))))))'
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||X(F((X(p1)&&G(p2))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0005P1-LTLFireability-07
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
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 15 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Applied a total of 19 rules in 10 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 07:09:01] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:09:01] [INFO ] Implicit Places using invariants in 38 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/25 places, 10/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 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 12 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 11 transition count 8
Applied a total of 4 rules in 3 ms. Remains 11 /13 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 07:09:01] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:09:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 07:09:01] [INFO ] Invariant cache hit.
[2023-03-08 07:09:01] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/25 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 144 ms. Remains : 11/25 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s9 1)), p2:(GEQ s6 1), p1:(LT s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 15102 reset in 141 ms.
Product exploration explored 100000 steps with 15106 reset in 167 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) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 250 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 395 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-08 07:09:03] [INFO ] Invariant cache hit.
[2023-03-08 07:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 07:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:09:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 07:09:03] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 07:09:03] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 07:09:03] [INFO ] Invariant cache hit.
[2023-03-08 07:09:03] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 07:09:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:09:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:09:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:03] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 07:09:03] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:09:03] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 07:09:03] [INFO ] Invariant cache hit.
[2023-03-08 07:09:03] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 07:09:03] [INFO ] Invariant cache hit.
[2023-03-08 07:09:03] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 07:09:03] [INFO ] Invariant cache hit.
[2023-03-08 07:09:03] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Finished random walk after 162 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=81 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 3 factoid took 318 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 273 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
[2023-03-08 07:09:05] [INFO ] Invariant cache hit.
[2023-03-08 07:09:05] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:09:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 07:09:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:09:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 07:09:05] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 07:09:05] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 07:09:05] [INFO ] Invariant cache hit.
[2023-03-08 07:09:05] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:09:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 07:09:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:09:05] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:09:05] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-08 07:09:05] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:09:05] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 270 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 15170 reset in 144 ms.
Product exploration explored 100000 steps with 15046 reset in 162 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 07:09:05] [INFO ] Invariant cache hit.
[2023-03-08 07:09:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 07:09:05] [INFO ] Invariant cache hit.
[2023-03-08 07:09:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 07:09:06] [INFO ] Invariant cache hit.
[2023-03-08 07:09:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-07 finished in 5138 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(F((p0&&F(!p1)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0005P1-LTLFireability-10
Stuttering acceptance computed with spot in 250 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 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 6 rules applied. Total rules applied 6 place count 22 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 10 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 18 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 10 ms. Remains 15 /25 variables (removed 10) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 07:09:06] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:09:06] [INFO ] Implicit Places using invariants in 42 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/25 places, 11/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 11 transition count 8
Applied a total of 6 rules in 6 ms. Remains 11 /14 variables (removed 3) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 07:09:06] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:09:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 07:09:06] [INFO ] Invariant cache hit.
[2023-03-08 07:09:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/25 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 148 ms. Remains : 11/25 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(OR (LT s4 1) (LT s7 1) (LT s1 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 112 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Finished random walk after 2947 steps, including 3 resets, run visited all 3 properties in 8 ms. (steps per millisecond=368 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 211 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 251 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 07:09:07] [INFO ] Invariant cache hit.
[2023-03-08 07:09:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 07:09:07] [INFO ] Invariant cache hit.
[2023-03-08 07:09:07] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 07:09:07] [INFO ] Invariant cache hit.
[2023-03-08 07:09:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Finished random walk after 1428 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=285 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (AND p1 p0))]
Knowledge based reduction with 2 factoid took 203 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 245 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 252 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 250 ms :[p1, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 07:09:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:09:09] [INFO ] Invariant cache hit.
[2023-03-08 07:09:10] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 11/11 places, 8/8 transitions.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 07:09:10] [INFO ] Invariant cache hit.
[2023-03-08 07:09:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 07:09:10] [INFO ] Invariant cache hit.
[2023-03-08 07:09:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 07:09:10] [INFO ] Invariant cache hit.
[2023-03-08 07:09:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLFireability-10 finished in 4069 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))'
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)))'
[2023-03-08 07:09:10] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:09:10] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 07:09:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 0 ms.
Total runtime 54937 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0005P1
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/364
LTLFireability

FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0005P1-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678259359226

--------------------
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 LTLFireability -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/364/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/364/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/364/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0005P1-LTLFireability-07
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLFireability-07: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLFireability-10: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLFireability-11: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/600 6/32 ClientsAndServers-PT-N0005P1-LTLFireability-07 925134 m, 185026 m/sec, 7545328 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 6
lola: FINISHED task # 7 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLFireability-07
lola: result : true
lola: markings : 1263826
lola: fired transitions : 10957334
lola: time used : 7.000000
lola: memory pages used : 9
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N0005P1-LTLFireability-10
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLFireability-10
lola: result : true
lola: markings : 7
lola: fired transitions : 7
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N0005P1-LTLFireability-06
lola: time limit : 898 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLFireability-06
lola: result : true
lola: markings : 10
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0005P1-LTLFireability-00
lola: time limit : 1197 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLFireability-00
lola: result : false
lola: markings : 326
lola: fired transitions : 327
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 18 (type EXCL) for 12 ClientsAndServers-PT-N0005P1-LTLFireability-11
lola: time limit : 1796 sec
lola: memory limit: 32 pages
lola: FINISHED task # 18 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLFireability-11
lola: result : false
lola: markings : 11
lola: fired transitions : 10
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 ClientsAndServers-PT-N0005P1-LTLFireability-13
lola: time limit : 3593 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLFireability-13
lola: result : false
lola: markings : 34510
lola: fired transitions : 46805
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLFireability-00: LTL false LTL model checker
ClientsAndServers-PT-N0005P1-LTLFireability-06: LTL true LTL model checker
ClientsAndServers-PT-N0005P1-LTLFireability-07: LTL true LTL model checker
ClientsAndServers-PT-N0005P1-LTLFireability-10: LTL true LTL model checker
ClientsAndServers-PT-N0005P1-LTLFireability-11: F true state space / EG
ClientsAndServers-PT-N0005P1-LTLFireability-13: LTL false LTL model checker


Time elapsed: 7 secs. Pages in use: 9

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-N0005P1"
export BK_EXAMINATION="LTLFireability"
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-N0005P1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397700236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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