fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r073-smll-167814399300220
Last Updated
May 14, 2023

About the Execution of LTSMin+red for ClientsAndServers-PT-N0002P1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
441.760 47480.00 65630.00 923.00 ?F?F?FTF??FFFFF? normal

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.r073-smll-167814399300220.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 ltsminxred
Input is ClientsAndServers-PT-N0002P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r073-smll-167814399300220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:14 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.3K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 16K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:15 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-N0002P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678312470307

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0002P1
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 21:54:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 21:54:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 21:54:33] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2023-03-08 21:54:33] [INFO ] Transformed 25 places.
[2023-03-08 21:54:33] [INFO ] Transformed 18 transitions.
[2023-03-08 21:54:33] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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 14 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 21:54:33] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-08 21:54:33] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 21:54:33] [INFO ] Invariant cache hit.
[2023-03-08 21:54:33] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-08 21:54:33] [INFO ] Invariant cache hit.
[2023-03-08 21:54:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-08 21:54:34] [INFO ] Flatten gal took : 24 ms
[2023-03-08 21:54:34] [INFO ] Flatten gal took : 15 ms
[2023-03-08 21:54:34] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 625 steps, including 0 resets, run visited all 19 properties in 65 ms. (steps per millisecond=9 )
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 13 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 21:54:34] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:54:34] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 21:54:34] [INFO ] Invariant cache hit.
[2023-03-08 21:54:34] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 21:54:34] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:34] [INFO ] Invariant cache hit.
[2023-03-08 21:54:34] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 218 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 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 25764 reset in 318 ms.
Product exploration explored 100000 steps with 25878 reset in 223 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 144 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
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 153 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-08 21:54:36] [INFO ] Invariant cache hit.
[2023-03-08 21:54:36] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 21:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 21:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 21:54:36] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:54:36] [INFO ] Added : 2 causal constraints over 1 iterations in 25 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, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 21:54:36] [INFO ] Invariant cache hit.
[2023-03-08 21:54:36] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 21:54:36] [INFO ] Invariant cache hit.
[2023-03-08 21:54:36] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 21:54:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:36] [INFO ] Invariant cache hit.
[2023-03-08 21:54:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 9/9 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 136 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 39 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 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 152 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 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2023-03-08 21:54:36] [INFO ] Invariant cache hit.
[2023-03-08 21:54:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:36] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 21:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:36] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 21:54:36] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:54:36] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25863 reset in 138 ms.
Product exploration explored 100000 steps with 25864 reset in 146 ms.
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 21:54:37] [INFO ] Invariant cache hit.
[2023-03-08 21:54:37] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 21:54:37] [INFO ] Invariant cache hit.
[2023-03-08 21:54:37] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 21:54:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:37] [INFO ] Invariant cache hit.
[2023-03-08 21:54:37] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 9/9 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-00 finished in 2650 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 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 3 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 21:54:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:37] [INFO ] Implicit Places using invariants in 32 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 7/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 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 7 transition count 4
Reduce places removed 3 places and 0 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 2 with 4 rules applied. Total rules applied 9 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 11 place count 3 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 12 place count 2 transition count 2
Applied a total of 12 rules in 3 ms. Remains 2 /9 variables (removed 7) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-08 21:54:37] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:54:37] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-08 21:54:37] [INFO ] Invariant cache hit.
[2023-03-08 21:54:37] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/25 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 82 ms. Remains : 2/25 places, 2/18 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-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:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-01 finished in 230 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||(F(!p0)&&F(G(p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 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 21:54:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 21:54:37] [INFO ] Implicit Places using invariants in 44 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 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 47 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s18 1)), p1:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1299 reset in 277 ms.
Product exploration explored 100000 steps with 1293 reset in 395 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 54 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:39] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:39] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 21:54:39] [INFO ] Invariant cache hit.
[2023-03-08 21:54:39] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2023-03-08 21:54:39] [INFO ] Invariant cache hit.
[2023-03-08 21:54:39] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 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) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 48 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 256 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1303 reset in 108 ms.
Product exploration explored 100000 steps with 1311 reset in 143 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 19 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 18 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 16 rules in 12 ms. Remains 18 /21 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-08 21:54:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2023-03-08 21:54:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/21 places, 15/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 18/21 places, 15/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:40] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:40] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 21:54:40] [INFO ] Invariant cache hit.
[2023-03-08 21:54:40] [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 21:54:40] [INFO ] Invariant cache hit.
[2023-03-08 21:54:40] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-02 finished in 3285 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(F((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 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 21:54:40] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 21:54:40] [INFO ] Implicit Places using invariants in 34 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 37 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s6 1) (GEQ s19 1)), p1:(GEQ s16 1), p2:(AND (GEQ s1 1) (GEQ s13 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][false, false, false, false]]
Product exploration explored 100000 steps with 4186 reset in 111 ms.
Product exploration explored 100000 steps with 4140 reset in 114 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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 46 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:42] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 21:54:42] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:54:42] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 21:54:42] [INFO ] Invariant cache hit.
[2023-03-08 21:54:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:42] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 21:54:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:42] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-08 21:54:42] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:54:42] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (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.
[2023-03-08 21:54:42] [INFO ] Invariant cache hit.
[2023-03-08 21:54:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 21:54:42] [INFO ] Invariant cache hit.
[2023-03-08 21:54:42] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 21:54:42] [INFO ] Invariant cache hit.
[2023-03-08 21:54:42] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 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 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
[2023-03-08 21:54:43] [INFO ] Invariant cache hit.
[2023-03-08 21:54:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 21:54:43] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:54:43] [INFO ] Added : 10 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 21:54:43] [INFO ] Invariant cache hit.
[2023-03-08 21:54:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:43] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 21:54:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:43] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 21:54:43] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:54:43] [INFO ] Added : 9 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 4163 reset in 107 ms.
Product exploration explored 100000 steps with 4142 reset in 108 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (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 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 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 7 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 20 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 20 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 5 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-08 21:54:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2023-03-08 21:54:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:44] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/21 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52 ms. Remains : 20/21 places, 17/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 21:54:44] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:54:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 21:54:44] [INFO ] Invariant cache hit.
[2023-03-08 21:54:44] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-08 21:54:44] [INFO ] Invariant cache hit.
[2023-03-08 21:54:44] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-04 finished in 3749 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(F(p0))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:44] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:44] [INFO ] Implicit Places using invariants in 30 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 33 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LT s18 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 33333 reset in 47 ms.
Product exploration explored 100000 steps with 33333 reset in 61 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 53 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-06 finished in 322 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(G(p0))||G(p1))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:54:45] [INFO ] Invariant cache hit.
[2023-03-08 21:54:45] [INFO ] Implicit Places using invariants in 26 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(AND (GEQ s4 1) (GEQ s14 1)), p0:(OR (LT s7 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 112 ms.
Stack based approach found an accepted trace after 383 steps with 0 reset with depth 384 and stack size 384 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-07 finished in 273 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(F(!p0))||G(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:54:45] [INFO ] Invariant cache hit.
[2023-03-08 21:54:45] [INFO ] Implicit Places using invariants in 31 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 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 36 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s8 1), p0:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3452 reset in 74 ms.
Product exploration explored 100000 steps with 3473 reset in 88 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 304 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Finished random walk after 53 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 299 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 78 ms :[p0, p0]
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 21:54:46] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 21:54:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:46] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 21:54:46] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:54:46] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 20 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 14 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 14 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 10 transition count 8
Applied a total of 20 rules in 7 ms. Remains 10 /20 variables (removed 10) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 21:54:46] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 21:54:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 21:54:46] [INFO ] Invariant cache hit.
[2023-03-08 21:54:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-08 21:54:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:46] [INFO ] Invariant cache hit.
[2023-03-08 21:54:46] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/20 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 10/20 places, 8/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
[2023-03-08 21:54:47] [INFO ] Invariant cache hit.
[2023-03-08 21:54:47] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:47] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 21:54:47] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:54:47] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Product exploration explored 100000 steps with 14128 reset in 60 ms.
Product exploration explored 100000 steps with 14188 reset in 78 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
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 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 7 transition count 4
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 12 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 14 place count 2 transition count 2
Applied a total of 14 rules in 4 ms. Remains 2 /10 variables (removed 8) and now considering 2/8 (removed 6) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-08 21:54:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:54:47] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-08 21:54:47] [INFO ] Invariant cache hit.
[2023-03-08 21:54:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-08 21:54:47] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:47] [INFO ] Invariant cache hit.
[2023-03-08 21:54:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/10 places, 2/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 2/10 places, 2/8 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-08 finished in 2296 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((X(F(p0))||(G(F(p2))&&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 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 21:54:47] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:54:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 21:54:47] [INFO ] Invariant cache hit.
[2023-03-08 21:54:47] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 21:54:47] [INFO ] Invariant cache hit.
[2023-03-08 21:54:47] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[(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 (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s15 1) (GEQ s0 1) (GEQ s13 1)), p2:(OR (LT s8 1) (LT s15 1)), p0:(AND (GEQ s5 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2684 reset in 85 ms.
Product exploration explored 100000 steps with 2687 reset in 95 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) p2 (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 393 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 540 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p0) (NOT p2))), (F p1), (F p0), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 468 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2023-03-08 21:54:49] [INFO ] Invariant cache hit.
[2023-03-08 21:54:49] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:49] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 21:54:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-08 21:54:49] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:54:49] [INFO ] Added : 15 causal constraints over 3 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:54:49] [INFO ] Invariant cache hit.
[2023-03-08 21:54:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 21:54:49] [INFO ] Invariant cache hit.
[2023-03-08 21:54:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-08 21:54:49] [INFO ] Invariant cache hit.
[2023-03-08 21:54:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 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) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 418 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 417 steps, including 0 resets, run visited all 4 properties in 8 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F p1), (F p0), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 521 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2023-03-08 21:54:51] [INFO ] Invariant cache hit.
[2023-03-08 21:54:51] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 21:54:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 21:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 21:54:51] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:54:51] [INFO ] Added : 15 causal constraints over 3 iterations in 22 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2682 reset in 82 ms.
Product exploration explored 100000 steps with 2703 reset in 97 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 8 rules in 5 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 21:54:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 21/21 places, 18/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 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:52] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 21:54:52] [INFO ] Invariant cache hit.
[2023-03-08 21:54:52] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-08 21:54:52] [INFO ] Invariant cache hit.
[2023-03-08 21:54:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-09 finished in 4707 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(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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 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 5 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 21:54:52] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:54:52] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 11/25 places, 9/18 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 99 ms.
Stack based approach found an accepted trace after 128 steps with 1 reset with depth 125 and stack size 125 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-10 finished in 290 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)||F((X(p2)&&p1))))'
Support contains 6 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 1 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 21:54:52] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 21:54:52] [INFO ] Implicit Places using invariants in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (GEQ s0 1) (GEQ s17 1)), p2:(AND (GEQ s2 1) (GEQ s13 1)), p0:(AND (GEQ s3 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 971 reset in 162 ms.
Stack based approach found an accepted trace after 4051 steps with 36 reset with depth 106 and stack size 106 in 8 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-11 finished in 381 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)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 21:54:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:54:52] [INFO ] Implicit Places using invariants in 41 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 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 44 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 64 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-14 finished in 189 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)||F((p1||X((p2 U p3))))))'
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 2 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 21:54:53] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 21:54:53] [INFO ] Implicit Places using invariants in 40 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 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 0 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 47 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s20 1)), p3:(AND (GEQ s6 1) (GEQ s20 1) (GEQ s10 1) (GEQ s16 1)), p0:(GEQ s11 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 4173 reset in 152 ms.
Product exploration explored 100000 steps with 4180 reset in 333 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 398 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p3))]
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 21:54:54] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 21:54:54] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:54:54] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 21:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:54:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 21:54:54] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 21:54:54] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:54:54] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 4 out of 22 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 : 22/22 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 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 9 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 10 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 15 transition count 11
Applied a total of 14 rules in 3 ms. Remains 15 /22 variables (removed 7) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 21:54:54] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 21:54:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 21:54:54] [INFO ] Invariant cache hit.
[2023-03-08 21:54:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 21:54:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:55] [INFO ] Invariant cache hit.
[2023-03-08 21:54:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/22 places, 11/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 15/22 places, 11/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p3))]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p3))]
[2023-03-08 21:54:55] [INFO ] Invariant cache hit.
[2023-03-08 21:54:55] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 21:54:55] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:54:55] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 21:54:55] [INFO ] Computed and/alt/rep : 10/12/10 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 21:54:55] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 4136 reset in 152 ms.
Product exploration explored 100000 steps with 4169 reset in 193 ms.
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Applied a total of 2 rules in 3 ms. Remains 14 /15 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 21:54:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 21:54:56] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 21:54:56] [INFO ] Invariant cache hit.
[2023-03-08 21:54:56] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-08 21:54:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:56] [INFO ] Invariant cache hit.
[2023-03-08 21:54:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/15 places, 10/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 14/15 places, 10/11 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-15 finished in 3128 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' '!(X(F((p0||(F(!p0)&&F(G(p1)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0002P1-LTLFireability-02
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions 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.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 13 transition count 9
Applied a total of 21 rules in 5 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 21:54:56] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 21:54:56] [INFO ] Implicit Places using invariants in 27 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/25 places, 9/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 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 8 transition count 6
Applied a total of 7 rules in 2 ms. Remains 8 /12 variables (removed 4) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 21:54:56] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 21:54:56] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-08 21:54:56] [INFO ] Invariant cache hit.
[2023-03-08 21:54:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 90 ms. Remains : 8/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1)), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 7611 reset in 105 ms.
Product exploration explored 100000 steps with 7511 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 21:54:57] [INFO ] Invariant cache hit.
[2023-03-08 21:54:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 21:54:57] [INFO ] Invariant cache hit.
[2023-03-08 21:54:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 21:54:57] [INFO ] Invariant cache hit.
[2023-03-08 21:54:57] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 280 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 317 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7501 reset in 89 ms.
Product exploration explored 100000 steps with 7453 reset in 93 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 21:54:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:54:59] [INFO ] Invariant cache hit.
[2023-03-08 21:54:59] [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 41 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 21:54:59] [INFO ] Invariant cache hit.
[2023-03-08 21:54:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 21:54:59] [INFO ] Invariant cache hit.
[2023-03-08 21:54:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-08 21:54:59] [INFO ] Invariant cache hit.
[2023-03-08 21:54:59] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-02 finished in 2787 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(F((p0||(p1&&F(p2)))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0002P1-LTLFireability-04
Stuttering acceptance computed with spot in 349 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 5 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 18 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 15 transition count 11
Applied a total of 17 rules in 6 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 21:54:59] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 21:54:59] [INFO ] Implicit Places using invariants in 36 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/25 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 45 ms. Remains : 14/25 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s4 1) (GEQ s12 1)), p1:(GEQ s11 1), p2:(AND (GEQ s0 1) (GEQ s9 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][false, false, false, false]]
Product exploration explored 100000 steps with 6062 reset in 148 ms.
Product exploration explored 100000 steps with 6066 reset in 174 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 (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 273 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 11 rows 14 cols
[2023-03-08 21:55:01] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 21:55:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 21:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:55:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2023-03-08 21:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 21:55:01] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:55:01] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 21:55:01] [INFO ] Invariant cache hit.
[2023-03-08 21:55:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 21:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:55:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 21:55:01] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:55:01] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 21:55:01] [INFO ] Invariant cache hit.
[2023-03-08 21:55:01] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 21:55:01] [INFO ] Invariant cache hit.
[2023-03-08 21:55:01] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 21:55:01] [INFO ] Invariant cache hit.
[2023-03-08 21:55:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 14/14 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 36 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
[2023-03-08 21:55:02] [INFO ] Invariant cache hit.
[2023-03-08 21:55:02] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 21:55:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:55:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 21:55:02] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:55:02] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
[2023-03-08 21:55:02] [INFO ] Invariant cache hit.
[2023-03-08 21:55:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 21:55:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:55:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 21:55:02] [INFO ] Computed and/alt/rep : 10/11/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:55:02] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 6057 reset in 141 ms.
Product exploration explored 100000 steps with 6043 reset in 167 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 21:55:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:55:03] [INFO ] Invariant cache hit.
[2023-03-08 21:55:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45 ms. Remains : 14/14 places, 11/11 transitions.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 21:55:03] [INFO ] Invariant cache hit.
[2023-03-08 21:55:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 21:55:03] [INFO ] Invariant cache hit.
[2023-03-08 21:55:03] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-08 21:55:03] [INFO ] Invariant cache hit.
[2023-03-08 21:55:03] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 14/14 places, 11/11 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-04 finished in 4760 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(F(!p0))||G(p1))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0002P1-LTLFireability-08
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), p0, p0]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 6 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 21:55:04] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:55:04] [INFO ] Implicit Places using invariants in 36 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 11/25 places, 9/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 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 3 ms. Remains 10 /11 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 21:55:04] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 21:55:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 21:55:04] [INFO ] Invariant cache hit.
[2023-03-08 21:55:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 10/25 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 123 ms. Remains : 10/25 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s4 1), p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12777 reset in 105 ms.
Product exploration explored 100000 steps with 12946 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 328 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Finished random walk after 21 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), true, (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 7 factoid took 261 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 94 ms :[p0, p0]
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
[2023-03-08 21:55:05] [INFO ] Invariant cache hit.
[2023-03-08 21:55:05] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 21:55:05] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:55:05] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG p0
Support contains 1 out of 10 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 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 21:55:05] [INFO ] Invariant cache hit.
[2023-03-08 21:55:05] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 21:55:05] [INFO ] Invariant cache hit.
[2023-03-08 21:55:05] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-08 21:55:05] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:55:05] [INFO ] Invariant cache hit.
[2023-03-08 21:55:05] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Finished random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 194 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 :[p0, p0]
Stuttering acceptance computed with spot in 98 ms :[p0, p0]
[2023-03-08 21:55:06] [INFO ] Invariant cache hit.
[2023-03-08 21:55:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 21:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 21:55:06] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:55:06] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 99 ms :[p0, p0]
Product exploration explored 100000 steps with 14055 reset in 97 ms.
Product exploration explored 100000 steps with 14119 reset in 122 ms.
Support contains 1 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
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 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 7 transition count 4
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 11 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 12 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 14 place count 2 transition count 2
Applied a total of 14 rules in 6 ms. Remains 2 /10 variables (removed 8) and now considering 2/8 (removed 6) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-08 21:55:06] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-08 21:55:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 21:55:06] [INFO ] Invariant cache hit.
[2023-03-08 21:55:06] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-08 21:55:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:55:06] [INFO ] Invariant cache hit.
[2023-03-08 21:55:06] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/10 places, 2/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 2/10 places, 2/8 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-08 finished in 2943 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((X(F(p0))||(G(F(p2))&&p1)))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0002P1-LTLFireability-09
Stuttering acceptance computed with spot in 219 ms :[(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 (NOT p2) (NOT p0))]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 18 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 5 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 21:55:07] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 21:55:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 21:55:07] [INFO ] Invariant cache hit.
[2023-03-08 21:55:07] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2023-03-08 21:55:07] [INFO ] Invariant cache hit.
[2023-03-08 21:55:07] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/25 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 122 ms. Remains : 13/25 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s6 1) (GEQ s11 1) (GEQ s0 1) (GEQ s9 1)), p2:(OR (LT s6 1) (LT s11 1)), p0:(AND (GEQ s4 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5751 reset in 129 ms.
Product exploration explored 100000 steps with 5759 reset in 168 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) p2 (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 398 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 49 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (AND (NOT p0) (NOT p2))), (F p1), (F p0), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2023-03-08 21:55:09] [INFO ] Invariant cache hit.
[2023-03-08 21:55:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:09] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 21:55:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:55:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 21:55:09] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:55:09] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 21:55:09] [INFO ] Invariant cache hit.
[2023-03-08 21:55:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 21:55:09] [INFO ] Invariant cache hit.
[2023-03-08 21:55:09] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 21:55:09] [INFO ] Invariant cache hit.
[2023-03-08 21:55:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 13/13 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 8 factoid took 735 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Finished random walk after 131 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), true, (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (AND (NOT p0) (NOT p2))), (F p1), (F p0), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 8 factoid took 673 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
[2023-03-08 21:55:11] [INFO ] Invariant cache hit.
[2023-03-08 21:55:11] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 21:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 21:55:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 21:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-08 21:55:11] [INFO ] Computed and/alt/rep : 9/9/9 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 21:55:11] [INFO ] Added : 4 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 5763 reset in 113 ms.
Product exploration explored 100000 steps with 5773 reset in 87 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 21:55:12] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:55:12] [INFO ] Invariant cache hit.
[2023-03-08 21:55:12] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 13/13 places, 10/10 transitions.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-08 21:55:12] [INFO ] Invariant cache hit.
[2023-03-08 21:55:12] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 21:55:12] [INFO ] Invariant cache hit.
[2023-03-08 21:55:12] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 21:55:12] [INFO ] Invariant cache hit.
[2023-03-08 21:55:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 13/13 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-09 finished in 5682 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)||F((p1||X((p2 U p3))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0002P1-LTLFireability-15
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3) (NOT p0))]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 19 transition count 14
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 16 place count 16 transition count 11
Applied a total of 16 rules in 6 ms. Remains 16 /25 variables (removed 9) and now considering 11/18 (removed 7) transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-08 21:55:12] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 21:55:12] [INFO ] Implicit Places using invariants in 39 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 15/25 places, 11/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 48 ms. Remains : 15/25 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0002P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s13 1)), p3:(AND (GEQ s3 1) (GEQ s13 1) (GEQ s5 1) (GEQ s11 1)), p0:(GEQ 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, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4144 reset in 152 ms.
Product exploration explored 100000 steps with 4153 reset in 176 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 364 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p0)), (X (AND (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p1) (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 7 factoid took 399 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p3))]
// Phase 1: matrix 11 rows 15 cols
[2023-03-08 21:55:14] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 21:55:14] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:55:14] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:14] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 21:55:14] [INFO ] Computed and/alt/rep : 10/12/10 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 21:55:14] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 4 out of 15 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 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 21:55:14] [INFO ] Invariant cache hit.
[2023-03-08 21:55:14] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 21:55:14] [INFO ] Invariant cache hit.
[2023-03-08 21:55:14] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 21:55:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:55:14] [INFO ] Invariant cache hit.
[2023-03-08 21:55:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 15/15 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p3))]
Finished random walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Knowledge obtained : [(AND (NOT p1) (NOT p3)), (X (AND (NOT p1) (NOT p3))), (X (X (AND (NOT p1) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3))))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p1) (NOT p3))]
[2023-03-08 21:55:15] [INFO ] Invariant cache hit.
[2023-03-08 21:55:15] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 21:55:15] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 21:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 21:55:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-08 21:55:15] [INFO ] Computed and/alt/rep : 10/12/10 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 21:55:15] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 4170 reset in 144 ms.
Product exploration explored 100000 steps with 4186 reset in 160 ms.
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Applied a total of 2 rules in 2 ms. Remains 14 /15 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 21:55:15] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 21:55:15] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 21:55:15] [INFO ] Invariant cache hit.
[2023-03-08 21:55:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-08 21:55:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 21:55:15] [INFO ] Invariant cache hit.
[2023-03-08 21:55:15] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/15 places, 10/11 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 184 ms. Remains : 14/15 places, 10/11 transitions.
Treatment of property ClientsAndServers-PT-N0002P1-LTLFireability-15 finished in 3142 ms.
[2023-03-08 21:55:15] [INFO ] Flatten gal took : 23 ms
[2023-03-08 21:55:15] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 30 ms.
[2023-03-08 21:55:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 42607 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2988/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2988/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2988/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2988/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2988/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2988/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N0002P1-LTLFireability-00
Could not compute solution for formula : ClientsAndServers-PT-N0002P1-LTLFireability-02
Could not compute solution for formula : ClientsAndServers-PT-N0002P1-LTLFireability-04
Could not compute solution for formula : ClientsAndServers-PT-N0002P1-LTLFireability-08
Could not compute solution for formula : ClientsAndServers-PT-N0002P1-LTLFireability-09
Could not compute solution for formula : ClientsAndServers-PT-N0002P1-LTLFireability-15

BK_STOP 1678312517787

--------------------
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
mcc2023
ltl formula name ClientsAndServers-PT-N0002P1-LTLFireability-00
ltl formula formula --ltl=/tmp/2988/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2988/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2988/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2988/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2988/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ClientsAndServers-PT-N0002P1-LTLFireability-02
ltl formula formula --ltl=/tmp/2988/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2988/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2988/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2988/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2988/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ClientsAndServers-PT-N0002P1-LTLFireability-04
ltl formula formula --ltl=/tmp/2988/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2988/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2988/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2988/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2988/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ClientsAndServers-PT-N0002P1-LTLFireability-08
ltl formula formula --ltl=/tmp/2988/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2988/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2988/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2988/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2988/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name ClientsAndServers-PT-N0002P1-LTLFireability-09
ltl formula formula --ltl=/tmp/2988/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2988/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2988/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2988/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2988/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ClientsAndServers-PT-N0002P1-LTLFireability-15
ltl formula formula --ltl=/tmp/2988/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2988/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2988/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2988/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2988/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-N0002P1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ClientsAndServers-PT-N0002P1, 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 r073-smll-167814399300220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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