About the Execution of LoLa+red for ClientsAndServers-PT-N0005P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1310.432 | 70595.00 | 83506.00 | 782.00 | TFTFT?FTTFFFFFT? | 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-167814397700235.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ClientsAndServers-PT-N0005P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397700235
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678259211124
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0005P1
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 07:06:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 07:06:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:06:54] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-08 07:06:54] [INFO ] Transformed 25 places.
[2023-03-08 07:06:54] [INFO ] Transformed 18 transitions.
[2023-03-08 07:06:54] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 13 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-08 07:06:54] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-08 07:06:55] [INFO ] Implicit Places using invariants in 205 ms returned []
[2023-03-08 07:06:55] [INFO ] Invariant cache hit.
[2023-03-08 07:06:55] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-08 07:06:55] [INFO ] Invariant cache hit.
[2023-03-08 07:06:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 20 out of 25 places after structural reductions.
[2023-03-08 07:06:55] [INFO ] Flatten gal took : 33 ms
[2023-03-08 07:06:55] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:06:55] [INFO ] Input system was already deterministic with 18 transitions.
Support contains 19 out of 25 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 07:06:56] [INFO ] Invariant cache hit.
[2023-03-08 07:06:56] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 07:06:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 07:06:56] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-08 07:06:56] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||(p0&&F((G(F(p1))||(p2&&F(p1))))))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 5 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:06:57] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 07:06:57] [INFO ] Implicit Places using invariants in 57 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 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 66 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 575 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT 1 s5), p1:(GT 1 s2), p2:(GT 1 s10)], 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 33333 reset in 527 ms.
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p2)
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-00 finished in 2016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p1) U (p0 U G(p2)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 13 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 07:06:58] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:06:58] [INFO ] Implicit Places using invariants in 36 ms returned [9]
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 : 12/25 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 10 cols
[2023-03-08 07:06:58] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:06:58] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 07:06:58] [INFO ] Invariant cache hit.
[2023-03-08 07:06:58] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p2), true, (OR (AND (NOT p1) p2) (AND p0 (NOT p1))), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) p0), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p2 (NOT p1)) (AND p0 (NOT p1))), acceptance={} source=2 dest: 1}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=5 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ 2 s4), p0:(LEQ s8 s5), p1:(LEQ 1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 94 steps with 1 reset in 3 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-01 finished in 509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 07:06:59] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-08 07:06:59] [INFO ] Implicit Places using invariants in 45 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-05 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s16), p1:(LEQ 1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 486 ms.
Product exploration explored 100000 steps with 17 reset in 446 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 4 factoid took 207 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 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:07:01] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-08 07:07:01] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:07:01] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 07:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:01] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-08 07:07:01] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 07:07:01] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-08 07:07:01] [INFO ] Invariant cache hit.
[2023-03-08 07:07:01] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:07:01] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-08 07:07:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:01] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-08 07:07:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:07:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:07:01] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 07:07:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 07:07:01] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-08 07:07:01] [INFO ] Added : 9 causal constraints over 2 iterations in 29 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:07:01] [INFO ] Invariant cache hit.
[2023-03-08 07:07:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 07:07:01] [INFO ] Invariant cache hit.
[2023-03-08 07:07:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-08 07:07:01] [INFO ] Invariant cache hit.
[2023-03-08 07:07:02] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 267 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 157 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Finished random walk after 53 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 341 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 :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
[2023-03-08 07:07:03] [INFO ] Invariant cache hit.
[2023-03-08 07:07:03] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:07:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 07:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 07:07:03] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-08 07:07:03] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-08 07:07:03] [INFO ] Invariant cache hit.
[2023-03-08 07:07:03] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:07:03] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 07:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:03] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 07:07:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:07:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:07:03] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 07:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:03] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2023-03-08 07:07:03] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 07:07:03] [INFO ] Added : 9 causal constraints over 2 iterations in 26 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 19 reset in 238 ms.
Product exploration explored 100000 steps with 20 reset in 309 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 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 22 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 6 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 19 transition count 15
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 19 transition count 15
Performed 3 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 3 rules applied. Total rules applied 18 place count 19 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 17 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 17 transition count 13
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 22 rules in 18 ms. Remains 17 /22 variables (removed 5) and now considering 13/18 (removed 5) transitions.
[2023-03-08 07:07:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 13 rows 17 cols
[2023-03-08 07:07:04] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-08 07:07:04] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/22 places, 13/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 17/22 places, 13/18 transitions.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:07:04] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:07:05] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 07:07:05] [INFO ] Invariant cache hit.
[2023-03-08 07:07:05] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-08 07:07:05] [INFO ] Invariant cache hit.
[2023-03-08 07:07:05] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-05 finished in 5852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 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 26 place count 10 transition count 7
Applied a total of 26 rules in 7 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 07:07:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:07:05] [INFO ] Implicit Places using invariants in 45 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/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 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-08 07:07:05] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 07:07:05] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 07:07:05] [INFO ] Invariant cache hit.
[2023-03-08 07:07:05] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 119 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15108 reset in 126 ms.
Product exploration explored 100000 steps with 15053 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=34 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-08 07:07:06] [INFO ] Invariant cache hit.
[2023-03-08 07:07:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 07:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 07:07:06] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-08 07:07:06] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 07:07:06] [INFO ] Invariant cache hit.
[2023-03-08 07:07:06] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 07:07:06] [INFO ] Invariant cache hit.
[2023-03-08 07:07:06] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 07:07:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:07:06] [INFO ] Invariant cache hit.
[2023-03-08 07:07:06] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Finished random walk after 74 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=74 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2023-03-08 07:07:06] [INFO ] Invariant cache hit.
[2023-03-08 07:07:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 07:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 07:07:06] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 07:07:06] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15064 reset in 125 ms.
Product exploration explored 100000 steps with 15118 reset in 134 ms.
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 07:07:07] [INFO ] Invariant cache hit.
[2023-03-08 07:07:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 07:07:07] [INFO ] Invariant cache hit.
[2023-03-08 07:07:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-08 07:07:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:07:07] [INFO ] Invariant cache hit.
[2023-03-08 07:07:07] [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 107 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-07 finished in 2210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:07:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 07:07:07] [INFO ] Implicit Places using invariants in 58 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-08 finished in 547 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))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:07:07] [INFO ] Invariant cache hit.
[2023-03-08 07:07:08] [INFO ] Implicit Places using invariants in 50 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 298 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s5 s13)], 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 11 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-09 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 07:07:08] [INFO ] Invariant cache hit.
[2023-03-08 07:07:08] [INFO ] Implicit Places using invariants in 41 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GT s12 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24266 steps with 2 reset in 61 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-10 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X((p1 U (!p0 U p2)))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 07:07:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:07:08] [INFO ] Implicit Places using invariants in 46 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 207 ms :[p2, p2, p2, true, p2]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT s16 s13), p1:(LEQ 3 s0), p2:(LEQ 2 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 265 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-11 finished in 284 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||F(p1)||(p2&&X(p3)))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 07:07:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:07:08] [INFO ] Implicit Places using invariants in 46 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(LEQ s17 s15), p1:(GT 1 s9), p2:(GT 3 s11), p3:(GT 2 s12)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 473 reset in 232 ms.
Product exploration explored 100000 steps with 457 reset in 253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 454 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Incomplete random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :3
Finished Best-First random walk after 498 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=124 )
Knowledge obtained : [(AND p0 p1 p2 p3), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 433 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 336 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 07:07:11] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:07:11] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-08 07:07:11] [INFO ] Invariant cache hit.
[2023-03-08 07:07:11] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-08 07:07:11] [INFO ] Invariant cache hit.
[2023-03-08 07:07:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2 p3), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 292 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Incomplete random walk after 10005 steps, including 5 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :3
Finished Best-First random walk after 295 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=147 )
Knowledge obtained : [(AND p0 p1 p2 p3), true, (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 4 factoid took 433 ms. Reduced automaton from 5 states, 7 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Stuttering acceptance computed with spot in 324 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Product exploration explored 100000 steps with 435 reset in 220 ms.
Product exploration explored 100000 steps with 449 reset in 230 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 355 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 5 place count 20 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 20 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 19 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 19 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 19 transition count 17
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 10 rules in 8 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2023-03-08 07:07:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2023-03-08 07:07:14] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:07:15] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 17/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 79 ms. Remains : 19/20 places, 17/18 transitions.
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 07:07:15] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 07:07:15] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-08 07:07:15] [INFO ] Invariant cache hit.
[2023-03-08 07:07:15] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-08 07:07:15] [INFO ] Invariant cache hit.
[2023-03-08 07:07:15] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 20/20 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-12 finished in 6280 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(G((!p0&&F(!p1))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 18 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 15 place count 16 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 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 25 place count 11 transition count 7
Applied a total of 25 rules in 11 ms. Remains 11 /25 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 11 cols
[2023-03-08 07:07:15] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 07:07:15] [INFO ] Implicit Places using invariants in 42 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 7/18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 10 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 9 transition count 6
Applied a total of 2 rules in 3 ms. Remains 9 /10 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 07:07:15] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:07:15] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 07:07:15] [INFO ] Invariant cache hit.
[2023-03-08 07:07:15] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s7), p1:(LEQ s3 s5)], 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 10247 reset in 126 ms.
Product exploration explored 100000 steps with 10286 reset in 147 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 (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 78 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 334 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-08 07:07:16] [INFO ] Invariant cache hit.
[2023-03-08 07:07:16] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 07:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-08 07:07:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:07:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:07:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 07:07:16] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-08 07:07:16] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 07:07:16] [INFO ] Invariant cache hit.
[2023-03-08 07:07:16] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 07:07:16] [INFO ] Invariant cache hit.
[2023-03-08 07:07:16] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 07:07:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:07:16] [INFO ] Invariant cache hit.
[2023-03-08 07:07:16] [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 110 ms. Remains : 9/9 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 283 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 78 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 341 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
[2023-03-08 07:07:17] [INFO ] Invariant cache hit.
[2023-03-08 07:07:17] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 07:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-08 07:07:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:07:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 07:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:07:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 07:07:17] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 07:07:17] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) p1)
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 10226 reset in 128 ms.
Product exploration explored 100000 steps with 10236 reset in 143 ms.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 07:07:18] [INFO ] Invariant cache hit.
[2023-03-08 07:07:18] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 07:07:18] [INFO ] Invariant cache hit.
[2023-03-08 07:07:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-08 07:07:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:07:18] [INFO ] Invariant cache hit.
[2023-03-08 07:07:18] [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 120 ms. Remains : 9/9 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-15 finished in 3336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(G(p1))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0005P1-LTLCardinality-05
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 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 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 19 transition count 12
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 17 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 3 with 6 rules applied. Total rules applied 20 place count 14 transition count 9
Applied a total of 20 rules in 7 ms. Remains 14 /25 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 14 cols
[2023-03-08 07:07:18] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 07:07:18] [INFO ] Implicit Places using invariants in 45 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/25 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 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 12 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 12 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7 place count 9 transition count 6
Applied a total of 7 rules in 10 ms. Remains 9 /13 variables (removed 4) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 07:07:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:07:18] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 07:07:18] [INFO ] Invariant cache hit.
[2023-03-08 07:07:18] [INFO ] Implicit Places using invariants and state equation in 36 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 : 9/25 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 134 ms. Remains : 9/25 places, 6/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-05 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=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 1 s6), p1:(LEQ 1 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 65 reset in 150 ms.
Stack based approach found an accepted trace after 1902 steps with 5 reset with depth 14 and stack size 14 in 4 ms.
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-05 finished in 655 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||F(p1)||(p2&&X(p3)))))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N0005P1-LTLCardinality-12
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3)))]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 19 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Applied a total of 16 rules in 11 ms. Remains 15 /25 variables (removed 10) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 15 cols
[2023-03-08 07:07:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 07:07:19] [INFO ] Implicit Places using invariants in 38 ms returned [10, 14]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/25 places, 12/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 11
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 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 11 transition count 10
Applied a total of 4 rules in 4 ms. Remains 11 /13 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-08 07:07:19] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 07:07:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 07:07:19] [INFO ] Invariant cache hit.
[2023-03-08 07:07:19] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 11/25 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 145 ms. Remains : 11/25 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0005P1-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p0 (NOT p1) (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(LEQ s10 s9), p1:(GT 1 s3), p2:(GT 3 s5), p3:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 908 reset in 179 ms.
Stack based approach found an accepted trace after 13967 steps with 115 reset with depth 145 and stack size 145 in 41 ms.
Treatment of property ClientsAndServers-PT-N0005P1-LTLCardinality-12 finished in 835 ms.
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-12 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(G((!p0&&F(!p1))))))'
[2023-03-08 07:07:20] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:07:20] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-08 07:07:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 25878 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N0005P1
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ClientsAndServers-PT-N0005P1-LTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678259281719
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N0005P1-LTLCardinality-15
lola: time limit : 600 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: Created skeleton in 0.000000 secs.
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/900 13/32 ClientsAndServers-PT-N0005P1-LTLCardinality-15 1892189 m, 378437 m/sec, 5874377 t fired, .
Time elapsed: 5 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 10/900 25/32 ClientsAndServers-PT-N0005P1-LTLCardinality-15 3741764 m, 369915 m/sec, 11689522 t fired, .
Time elapsed: 10 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 10 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N0005P1-LTLCardinality-12
lola: time limit : 1195 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLCardinality-12
lola: result : false
lola: markings : 35316
lola: fired transitions : 85861
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N0005P1-LTLCardinality-05
lola: time limit : 1792 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1792 9/32 ClientsAndServers-PT-N0005P1-LTLCardinality-05 1376975 m, 275395 m/sec, 4213934 t fired, .
Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1792 17/32 ClientsAndServers-PT-N0005P1-LTLCardinality-05 2517734 m, 228151 m/sec, 7946465 t fired, .
Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1792 24/32 ClientsAndServers-PT-N0005P1-LTLCardinality-05 3558642 m, 208181 m/sec, 11440150 t fired, .
Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1792 30/32 ClientsAndServers-PT-N0005P1-LTLCardinality-05 4558083 m, 199888 m/sec, 14828386 t fired, .
Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 1 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLCardinality-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL false LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 12 (type EXCL) for 3 ClientsAndServers-PT-N0005P1-LTLCardinality-07
lola: time limit : 3560 sec
lola: memory limit: 32 pages
lola: FINISHED task # 12 (type EXCL) for ClientsAndServers-PT-N0005P1-LTLCardinality-07
lola: result : false
lola: markings : 907
lola: fired transitions : 1194
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N0005P1-LTLCardinality-05: LTL unknown AGGR
ClientsAndServers-PT-N0005P1-LTLCardinality-07: F true state space / EG
ClientsAndServers-PT-N0005P1-LTLCardinality-12: LTL false LTL model checker
ClientsAndServers-PT-N0005P1-LTLCardinality-15: LTL unknown AGGR
Time elapsed: 40 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-N0005P1"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-N0005P1, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397700235"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0005P1.tgz
mv ClientsAndServers-PT-N0005P1 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;