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

About the Execution of LoLa+red for ClientsAndServers-PT-N0020P1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
763.531 105067.00 129105.00 1163.30 FFTFFFFF?FFFFFTF 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.r071-smll-167814397800276.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ClientsAndServers-PT-N0020P1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397800276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:23 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.9K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 13K Feb 26 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Feb 26 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 13:24 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-N0020P1-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678265095756

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P1
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 08:44:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 08:44:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:44:59] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-08 08:44:59] [INFO ] Transformed 25 places.
[2023-03-08 08:44:59] [INFO ] Transformed 18 transitions.
[2023-03-08 08:44:59] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 21 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 08:45:00] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-08 08:45:00] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-08 08:45:00] [INFO ] Invariant cache hit.
[2023-03-08 08:45:00] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 08:45:00] [INFO ] Invariant cache hit.
[2023-03-08 08:45:00] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 474 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 22 out of 24 places after structural reductions.
[2023-03-08 08:45:00] [INFO ] Flatten gal took : 35 ms
[2023-03-08 08:45:00] [INFO ] Flatten gal took : 11 ms
[2023-03-08 08:45:00] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 21 out of 24 places (down from 22) after GAL structural reductions.
Finished random walk after 777 steps, including 0 resets, run visited all 19 properties in 40 ms. (steps per millisecond=19 )
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-05 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' '!(X((!p0 U (G(!p0)||(F(G(!p2))&&p1)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:45:01] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-08 08:45:01] [INFO ] Implicit Places using invariants in 69 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 3 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 79 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 499 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, p2, (AND p2 p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s15 1) (NOT (AND (GEQ s1 1) (GEQ s17 1)))), p0:(AND (GEQ s1 1) (GEQ s17 1)), p2:(AND (GEQ s5 1) (GEQ 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 700 ms.
Product exploration explored 100000 steps with 0 reset in 378 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 10 factoid took 755 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, p2, (AND p2 p0)]
Incomplete random walk after 10023 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=213 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:04] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-08 08:45:04] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p2), (F (AND (NOT p0) p1)), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 908 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[p0, p0, true, p2, (AND p2 p0)]
Stuttering acceptance computed with spot in 241 ms :[p0, p0, true, p2, (AND p2 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 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 08:45:06] [INFO ] Invariant cache hit.
[2023-03-08 08:45:06] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 08:45:06] [INFO ] Invariant cache hit.
[2023-03-08 08:45:06] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-08 08:45:06] [INFO ] Invariant cache hit.
[2023-03-08 08:45:06] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 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 p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 6 factoid took 461 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[p0, p0, true, p2, (AND p2 p0)]
Finished random walk after 695 steps, including 0 resets, run visited all 4 properties in 6 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F p2), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND p1 (NOT p0))), (F p0)]
Knowledge based reduction with 6 factoid took 596 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[p0, p0, true, p2, (AND p2 p0)]
Stuttering acceptance computed with spot in 237 ms :[p0, p0, true, p2, (AND p2 p0)]
Stuttering acceptance computed with spot in 233 ms :[p0, p0, true, p2, (AND p2 p0)]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 361 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[p0, p0, true, p2, (AND p2 p0)]
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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 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 4 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 19 transition count 16
Deduced a syphon composed of 5 places in 5 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 19 transition count 16
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 13 place count 19 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 15 rules in 36 ms. Remains 18 /21 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2023-03-08 08:45:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 18 cols
[2023-03-08 08:45:09] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:09] [INFO ] Dead Transitions using invariants and state equation in 47 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 94 ms. Remains : 18/21 places, 15/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 08:45:09] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-08 08:45:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 08:45:09] [INFO ] Invariant cache hit.
[2023-03-08 08:45:09] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-08 08:45:09] [INFO ] Invariant cache hit.
[2023-03-08 08:45:09] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-00 finished in 8444 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)||G((F(!p0)&&F(p1))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 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 9
Applied a total of 20 rules in 6 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 08:45:10] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:10] [INFO ] Implicit Places using invariants in 51 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 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 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 08:45:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 08:45:10] [INFO ] Invariant cache hit.
[2023-03-08 08:45:10] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 153 ms. Remains : 10/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s8 1)), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1807 reset in 274 ms.
Stack based approach found an accepted trace after 56 steps with 1 reset with depth 37 and stack size 37 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-01 finished in 559 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p1 U p2)||p0))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:10] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-08 08:45:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 08:45:10] [INFO ] Invariant cache hit.
[2023-03-08 08:45:10] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-08 08:45:10] [INFO ] Invariant cache hit.
[2023-03-08 08:45:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(GEQ s18 1), p1:(AND (GEQ s3 1) (GEQ s14 1)), p0:(OR (LT s3 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 131 ms.
Product exploration explored 100000 steps with 33333 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-02 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:45:11] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:11] [INFO ] Implicit Places using invariants in 52 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-03 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1361 reset in 174 ms.
Product exploration explored 100000 steps with 1371 reset in 186 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1113 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=371 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:12] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 08:45:13] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:13] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 08:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:13] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 08:45:13] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 08:45:13] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2023-03-08 08:45:13] [INFO ] Invariant cache hit.
[2023-03-08 08:45:13] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 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 : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 695 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=347 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 08:45:14] [INFO ] Invariant cache hit.
[2023-03-08 08:45:14] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:14] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-08 08:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:45:14] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 08:45:14] [INFO ] Added : 13 causal constraints over 3 iterations in 35 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1366 reset in 182 ms.
Product exploration explored 100000 steps with 1330 reset in 192 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 7 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 18 transition count 15
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 11 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-08 08:45:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-08 08:45:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 17/21 places, 14/18 transitions.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:15] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 08:45:15] [INFO ] Invariant cache hit.
[2023-03-08 08:45:15] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-08 08:45:15] [INFO ] Invariant cache hit.
[2023-03-08 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-03 finished in 4114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((F(!p1)&&F(p0))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:45:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:15] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s10 1), p1:(OR (LT s4 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 1068 reset in 185 ms.
Product exploration explored 100000 steps with 1046 reset in 207 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 559 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 1203 steps, including 0 resets, run visited all 5 properties in 14 ms. (steps per millisecond=85 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 736 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:18] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-08 08:45:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:18] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-08 08:45:18] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 08:45:18] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 08:45:18] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 08:45:18] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2023-03-08 08:45:18] [INFO ] Invariant cache hit.
[2023-03-08 08:45:18] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 642 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 1066 steps, including 0 resets, run visited all 5 properties in 8 ms. (steps per millisecond=133 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 696 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
[2023-03-08 08:45:20] [INFO ] Invariant cache hit.
[2023-03-08 08:45:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:20] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-08 08:45:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:20] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:45:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 08:45:20] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 08:45:20] [INFO ] Invariant cache hit.
[2023-03-08 08:45:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:20] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:45:20] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 08:45:20] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 1066 reset in 182 ms.
Product exploration explored 100000 steps with 1060 reset in 204 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) 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 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 21 transition count 18
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 14 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 18 place count 17 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 7 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-08 08:45:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-08 08:45:21] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:21] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 17/21 places, 14/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 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:21] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:21] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 08:45:21] [INFO ] Invariant cache hit.
[2023-03-08 08:45:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-08 08:45:21] [INFO ] Invariant cache hit.
[2023-03-08 08:45:22] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 146 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-04 finished in 6501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 11 place count 17 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 8 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 08:45:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:22] [INFO ] Implicit Places using invariants in 35 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 48 ms. Remains : 10/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s3 1) (OR (LT s2 1) (LT s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 888 reset in 161 ms.
Stack based approach found an accepted trace after 596 steps with 10 reset with depth 529 and stack size 529 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-07 finished in 328 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((G(F(p0))||(F(p0)&&G(p1)))))||(F(!p0)&&X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:22] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:45:22] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s10 1), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1676 reset in 157 ms.
Product exploration explored 100000 steps with 1668 reset in 181 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 1095 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 365 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 08:45:24] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 08:45:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:24] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:45:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 08:45:24] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 08:45:24] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 20 transition count 10
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 12 transition count 8
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 10 transition count 8
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 24 place count 8 transition count 6
Applied a total of 24 rules in 6 ms. Remains 8 /20 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 08:45:24] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 08:45:24] [INFO ] Implicit Places using invariants in 36 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/20 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 44 ms. Remains : 7/20 places, 6/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 165 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=82 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 574 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 6 rows 7 cols
[2023-03-08 08:45:26] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:45:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 08:45:26] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 08:45:26] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7207 reset in 127 ms.
Product exploration explored 100000 steps with 7204 reset in 144 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 08:45:26] [INFO ] Invariant cache hit.
[2023-03-08 08:45:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 08:45:26] [INFO ] Invariant cache hit.
[2023-03-08 08:45:26] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 08:45:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:26] [INFO ] Invariant cache hit.
[2023-03-08 08:45:26] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-08 finished in 4619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G(p1)))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 2 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:27] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-08 08:45:27] [INFO ] Implicit Places using invariants in 42 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s17 1), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-09 finished in 245 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 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 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 21 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 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 13 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 15 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 21 place count 12 transition count 9
Applied a total of 21 rules in 5 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 08:45:27] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:45:27] [INFO ] Implicit Places using invariants in 48 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/24 places, 9/18 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 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 7
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-08 08:45:27] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 08:45:27] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 08:45:27] [INFO ] Invariant cache hit.
[2023-03-08 08:45:27] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 122 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-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:(LT s7 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11004 steps with 0 reset in 17 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-10 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0))) U (p1 U !p2)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:45:27] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:27] [INFO ] Implicit Places using invariants in 40 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 358 ms :[p2, (NOT p0), (AND (NOT p0) p2), (NOT p0), true, (AND (NOT p0) p2), p2]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(OR (LT s11 1) (LT s16 1)), p1:(AND (GEQ s8 1) (GEQ s14 1)), p0:(GEQ s20 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5366 steps with 3 reset in 18 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-11 finished in 449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0&&X((!p0 U (p1||G(!p0)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 08:45:28] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 08:45:28] [INFO ] Implicit Places using invariants in 35 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s13 1)), p1:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-12 finished in 233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(p1))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 1 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
[2023-03-08 08:45:28] [INFO ] Invariant cache hit.
[2023-03-08 08:45:28] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 174 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s16 1), p0:(OR (GEQ s16 1) (GEQ s18 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-13 finished in 233 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) U G(!p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:45:28] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 08:45:28] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 08:45:28] [INFO ] Invariant cache hit.
[2023-03-08 08:45:28] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-08 08:45:28] [INFO ] Invariant cache hit.
[2023-03-08 08:45:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, p1, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s19 1)), p0:(AND (GEQ s3 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3505 reset in 272 ms.
Product exploration explored 100000 steps with 3096 reset in 533 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 295 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p0]
Finished random walk after 2160 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=540 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 426 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p0]
Stuttering acceptance computed with spot in 155 ms :[p1, p1, p0]
[2023-03-08 08:45:30] [INFO ] Invariant cache hit.
[2023-03-08 08:45:30] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-08 08:45:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 08:45:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-08 08:45:30] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 08:45:30] [INFO ] Added : 15 causal constraints over 3 iterations in 28 ms. Result :sat
Could not prove EG p1
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 08:45:31] [INFO ] Invariant cache hit.
[2023-03-08 08:45:31] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 08:45:31] [INFO ] Invariant cache hit.
[2023-03-08 08:45:31] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-08 08:45:31] [INFO ] Invariant cache hit.
[2023-03-08 08:45:31] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 141 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 315 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p1, p1, p0]
Finished random walk after 777 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=388 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X p1), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (AND p1 p0))]
Knowledge based reduction with 6 factoid took 416 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[p1, p1, p0]
Stuttering acceptance computed with spot in 160 ms :[p1, p1, p0]
[2023-03-08 08:45:32] [INFO ] Invariant cache hit.
[2023-03-08 08:45:32] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 08:45:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-08 08:45:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:32] [INFO ] [Nat]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 08:45:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-08 08:45:32] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 08:45:32] [INFO ] Added : 15 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p0]
Product exploration explored 100000 steps with 3302 reset in 201 ms.
Product exploration explored 100000 steps with 3222 reset in 246 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 157 ms :[p1, p1, p0]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 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 22 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 3 place count 22 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 22 transition count 18
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 8 place count 22 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 21 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 21 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 7 ms. Remains 21 /22 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-08 08:45:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 21 cols
[2023-03-08 08:45:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:33] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/22 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51 ms. Remains : 21/22 places, 17/18 transitions.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 08:45:33] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 08:45:33] [INFO ] Invariant cache hit.
[2023-03-08 08:45:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-08 08:45:33] [INFO ] Invariant cache hit.
[2023-03-08 08:45:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-15 finished in 5215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (G(!p0)||(F(G(!p2))&&p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-03
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 7 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 08:45:34] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 08:45:34] [INFO ] Implicit Places using invariants in 42 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 10/24 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 3 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 08:45:34] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 08:45:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 08:45:34] [INFO ] Invariant cache hit.
[2023-03-08 08:45:34] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 8/24 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 122 ms. Remains : 8/24 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-03 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s7 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 7457 reset in 115 ms.
Product exploration explored 100000 steps with 7479 reset in 131 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 282 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=165 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 08:45:35] [INFO ] Invariant cache hit.
[2023-03-08 08:45:35] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 08:45:35] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 08:45:35] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 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 08:45:35] [INFO ] Invariant cache hit.
[2023-03-08 08:45:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 08:45:35] [INFO ] Invariant cache hit.
[2023-03-08 08:45:35] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 08:45:35] [INFO ] Invariant cache hit.
[2023-03-08 08:45:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 475 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=475 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 146 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 08:45:36] [INFO ] Invariant cache hit.
[2023-03-08 08:45:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 08:45:36] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 08:45:36] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7468 reset in 115 ms.
Product exploration explored 100000 steps with 7457 reset in 129 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 08:45:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:37] [INFO ] Invariant cache hit.
[2023-03-08 08:45:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44 ms. Remains : 8/8 places, 6/6 transitions.
Support contains 2 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 08:45:37] [INFO ] Invariant cache hit.
[2023-03-08 08:45:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 08:45:37] [INFO ] Invariant cache hit.
[2023-03-08 08:45:37] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-08 08:45:37] [INFO ] Invariant cache hit.
[2023-03-08 08:45:37] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-03 finished in 3838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((F(!p1)&&F(p0))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-04
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 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 9
Applied a total of 20 rules in 10 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 08:45:38] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 08:45:38] [INFO ] Implicit Places using invariants in 72 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 74 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 12/24 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 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 4 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 08:45:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:45:38] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 08:45:38] [INFO ] Invariant cache hit.
[2023-03-08 08:45:38] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/24 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 173 ms. Remains : 11/24 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s6 1), p1:(OR (LT s3 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 4118 reset in 147 ms.
Product exploration explored 100000 steps with 4158 reset in 166 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 550 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 643 steps, including 1 resets, run visited all 5 properties in 6 ms. (steps per millisecond=107 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 808 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
[2023-03-08 08:45:40] [INFO ] Invariant cache hit.
[2023-03-08 08:45:40] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 08:45:40] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 08:45:40] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 08:45:40] [INFO ] Invariant cache hit.
[2023-03-08 08:45:40] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 08:45:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 08:45:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:40] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:40] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 08:45:40] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 08:45:40] [INFO ] Added : 5 causal constraints over 1 iterations in 13 ms. Result :sat
Could not prove EG p1
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 08:45:40] [INFO ] Invariant cache hit.
[2023-03-08 08:45:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 08:45:40] [INFO ] Invariant cache hit.
[2023-03-08 08:45:40] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 08:45:40] [INFO ] Invariant cache hit.
[2023-03-08 08:45:40] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 11/11 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 551 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Finished random walk after 370 steps, including 0 resets, run visited all 5 properties in 4 ms. (steps per millisecond=92 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 p1)), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 709 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
[2023-03-08 08:45:42] [INFO ] Invariant cache hit.
[2023-03-08 08:45:42] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 08:45:42] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 08:45:42] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-08 08:45:42] [INFO ] Invariant cache hit.
[2023-03-08 08:45:43] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:43] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 08:45:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 08:45:43] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 08:45:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 08:45:43] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 08:45:43] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 4165 reset in 149 ms.
Product exploration explored 100000 steps with 4182 reset in 189 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), p1, (NOT p0), (OR (NOT p0) p1)]
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 08:45:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:43] [INFO ] Invariant cache hit.
[2023-03-08 08:45:44] [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 : 11/11 places, 8/8 transitions.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 08:45:44] [INFO ] Invariant cache hit.
[2023-03-08 08:45:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 08:45:44] [INFO ] Invariant cache hit.
[2023-03-08 08:45:44] [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 08:45:44] [INFO ] Invariant cache hit.
[2023-03-08 08:45:44] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 11/11 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-04 finished in 6474 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((G(F(p0))||(F(p0)&&G(p1)))))||(F(!p0)&&X(F((G(F(p0))||(F(p0)&&G(p1)))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-08
Stuttering acceptance computed with spot in 276 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 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 21 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 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 10 transition count 7
Applied a total of 25 rules in 9 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 08:45:44] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 08:45:44] [INFO ] Implicit Places using invariants in 37 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/24 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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Applied a total of 2 rules in 5 ms. Remains 7 /8 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-08 08:45:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 08:45:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 08:45:44] [INFO ] Invariant cache hit.
[2023-03-08 08:45:44] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 7/24 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 120 ms. Remains : 7/24 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s4 1), p1:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7273 reset in 112 ms.
Product exploration explored 100000 steps with 7231 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 247 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 247 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 354 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-08 08:45:46] [INFO ] Invariant cache hit.
[2023-03-08 08:45:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 08:45:46] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 08:45:46] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 08:45:46] [INFO ] Invariant cache hit.
[2023-03-08 08:45:46] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 08:45:46] [INFO ] Invariant cache hit.
[2023-03-08 08:45:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-08 08:45:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:46] [INFO ] Invariant cache hit.
[2023-03-08 08:45:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 7/7 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 441 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 165 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=165 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 577 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
[2023-03-08 08:45:48] [INFO ] Invariant cache hit.
[2023-03-08 08:45:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 08:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 08:45:48] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 08:45:48] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 08:45:48] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7152 reset in 125 ms.
Product exploration explored 100000 steps with 7280 reset in 133 ms.
Support contains 2 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 08:45:48] [INFO ] Invariant cache hit.
[2023-03-08 08:45:48] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 08:45:48] [INFO ] Invariant cache hit.
[2023-03-08 08:45:48] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-08 08:45:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 08:45:48] [INFO ] Invariant cache hit.
[2023-03-08 08:45:48] [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 101 ms. Remains : 7/7 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-08 finished in 4572 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) U G(!p1))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0020P1-LTLFireability-15
Stuttering acceptance computed with spot in 153 ms :[p1, p1, p0]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 19 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 19 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 6 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 08:45:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 08:45:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 08:45:49] [INFO ] Invariant cache hit.
[2023-03-08 08:45:49] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-08 08:45:49] [INFO ] Invariant cache hit.
[2023-03-08 08:45:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/24 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 147 ms. Remains : 14/24 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s12 1)), p0:(AND (GEQ s3 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2203 reset in 176 ms.
Stack based approach found an accepted trace after 3558 steps with 71 reset with depth 57 and stack size 57 in 8 ms.
Treatment of property ClientsAndServers-PT-N0020P1-LTLFireability-15 finished in 636 ms.
FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-15 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-08 08:45:49] [INFO ] Flatten gal took : 7 ms
[2023-03-08 08:45:49] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-08 08:45:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 1 ms.
Total runtime 49821 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0020P1
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N0020P1-LTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

BK_STOP 1678265200823

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N0020P1-LTLFireability-03
lola: time limit : 720 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N0020P1-LTLFireability-03
lola: result : false
lola: markings : 1073
lola: fired transitions : 1073
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N0020P1-LTLFireability-08
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/900 4/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 578235 m, 115647 m/sec, 7222992 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/900 8/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 1116000 m, 107553 m/sec, 14753259 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 15/900 11/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 1667431 m, 110286 m/sec, 22168638 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 20/900 14/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 2161285 m, 98770 m/sec, 29500582 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 25/900 17/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 2655827 m, 98908 m/sec, 36742139 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 30/900 21/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 3184350 m, 105704 m/sec, 44094676 t fired, .

Time elapsed: 30 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 35/900 24/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 3656628 m, 94455 m/sec, 51235607 t fired, .

Time elapsed: 35 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 40/900 27/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 4174856 m, 103645 m/sec, 58581155 t fired, .

Time elapsed: 40 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 5
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 45/900 30/32 ClientsAndServers-PT-N0020P1-LTLFireability-08 4643462 m, 93721 m/sec, 65866834 t fired, .

Time elapsed: 45 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 5
lola: CANCELED task # 10 (type EXCL) for ClientsAndServers-PT-N0020P1-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 5
lola: LAUNCH task # 13 (type EXCL) for 12 ClientsAndServers-PT-N0020P1-LTLFireability-15
lola: time limit : 1183 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for ClientsAndServers-PT-N0020P1-LTLFireability-15
lola: result : false
lola: markings : 1202
lola: fired transitions : 1203
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0020P1-LTLFireability-04
lola: time limit : 1775 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ClientsAndServers-PT-N0020P1-LTLFireability-04
lola: result : false
lola: markings : 1073
lola: fired transitions : 1073
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0020P1-LTLFireability-00
lola: time limit : 3550 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N0020P1-LTLFireability-00
lola: result : false
lola: markings : 1112
lola: fired transitions : 1124
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 5

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0020P1-LTLFireability-00: LTL false LTL model checker
ClientsAndServers-PT-N0020P1-LTLFireability-03: LTL false LTL model checker
ClientsAndServers-PT-N0020P1-LTLFireability-04: LTL false LTL model checker
ClientsAndServers-PT-N0020P1-LTLFireability-08: LTL unknown AGGR
ClientsAndServers-PT-N0020P1-LTLFireability-15: LTL false LTL model checker


Time elapsed: 50 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0020P1"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-N0020P1, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397800276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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