Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Feb 26 13:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:44 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-N2000P0-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678439350366

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N2000P0
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 09:09:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 09:09:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 09:09:13] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-10 09:09:13] [INFO ] Transformed 25 places.
[2023-03-10 09:09:13] [INFO ] Transformed 18 transitions.
[2023-03-10 09:09:13] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-10 09:09:13] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-10 09:09:13] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-10 09:09:13] [INFO ] Invariant cache hit.
[2023-03-10 09:09:13] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-10 09:09:13] [INFO ] Invariant cache hit.
[2023-03-10 09:09:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-10 09:09:13] [INFO ] Flatten gal took : 24 ms
[2023-03-10 09:09:13] [INFO ] Flatten gal took : 7 ms
[2023-03-10 09:09:13] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=551 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=17 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 09:09:14] [INFO ] Invariant cache hit.
[2023-03-10 09:09:14] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-10 09:09:14] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-10 09:09:14] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-10 09:09:14] [INFO ] After 40ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 09:09:14] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 09:09:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:14] [INFO ] [Nat]Absence check using 5 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-10 09:09:14] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 09:09:14] [INFO ] After 40ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-10 09:09:14] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 92013 steps, including 0 resets, run visited all 2 properties in 557 ms. (steps per millisecond=165 )
Parikh walk visited 2 properties in 560 ms.
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' '!(G((F(p0)||G(p1))))'
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 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 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Applied a total of 20 rules in 12 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-10 09:09:15] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:15] [INFO ] Implicit Places using invariants in 31 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/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 11 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 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 7
Applied a total of 6 rules in 3 ms. Remains 8 /11 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-10 09:09:15] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 09:09:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 09:09:15] [INFO ] Invariant cache hit.
[2023-03-10 09:09:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 112 ms. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (OR (LT s2 1) (LT s5 1)) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 70 reset in 318 ms.
Product exploration explored 100000 steps with 250 reset in 278 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 145 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 81 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 2 factoid took 182 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 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-10 09:09:16] [INFO ] Invariant cache hit.
[2023-03-10 09:09:16] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 09:09:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:16] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-10 09:09:16] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 09:09:16] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 09:09:16] [INFO ] Invariant cache hit.
[2023-03-10 09:09:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 09:09:17] [INFO ] Invariant cache hit.
[2023-03-10 09:09:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 09:09:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:09:17] [INFO ] Invariant cache hit.
[2023-03-10 09:09:17] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 8/8 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 131 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 80 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 2 factoid took 173 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 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-10 09:09:17] [INFO ] Invariant cache hit.
[2023-03-10 09:09:17] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:17] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-10 09:09:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:17] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-10 09:09:17] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 09:09:17] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 78 reset in 112 ms.
Product exploration explored 100000 steps with 263 reset in 303 ms.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-10 09:09:18] [INFO ] Invariant cache hit.
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 09:09:18] [INFO ] Invariant cache hit.
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-10 09:09:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:09:18] [INFO ] Invariant cache hit.
[2023-03-10 09:09:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 8/8 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-00 finished in 3108 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 09:09:18] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-10 09:09:18] [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 : 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 45 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s16 1) (LT s1 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 129 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-01 finished in 156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 9 transition count 6
Applied a total of 28 rules in 7 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-10 09:09:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants in 38 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/25 places, 6/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 6 transition count 5
Applied a total of 2 rules in 2 ms. Remains 6 /7 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-10 09:09:18] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 09:09:18] [INFO ] Invariant cache hit.
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 60 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 112 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-02 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0||G(p1))) U 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 17 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 6 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-10 09:09:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants in 40 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/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 10 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 9 transition count 8
Applied a total of 2 rules in 2 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-10 09:09:18] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 09:09:18] [INFO ] Invariant cache hit.
[2023-03-10 09:09:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 111 ms. Remains : 9/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (AND p0 (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s7 1), p0:(OR (LT s0 1) (LT s5 1)), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23091 reset in 180 ms.
Product exploration explored 100000 steps with 23255 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 7 factoid took 381 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Finished Best-First random walk after 346 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=173 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p2) p0))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 429 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-10 09:09:20] [INFO ] Invariant cache hit.
[2023-03-10 09:09:20] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:20] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-10 09:09:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-10 09:09:20] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 09:09:20] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 3 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 09:09:20] [INFO ] Invariant cache hit.
[2023-03-10 09:09:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 09:09:20] [INFO ] Invariant cache hit.
[2023-03-10 09:09:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 09:09:20] [INFO ] Invariant cache hit.
[2023-03-10 09:09:20] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 79 ms. Remains : 9/9 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Finished Best-First random walk after 600 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-10 09:09:21] [INFO ] Invariant cache hit.
[2023-03-10 09:09:21] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-10 09:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:21] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 09:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:21] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:21] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 09:09:21] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 09:09:21] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15058 reset in 84 ms.
Product exploration explored 100000 steps with 15202 reset in 91 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 78 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 4 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-10 09:09:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2023-03-10 09:09:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 09:09:22] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 8/8 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-10 09:09:22] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 09:09:22] [INFO ] Invariant cache hit.
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 09:09:22] [INFO ] Invariant cache hit.
[2023-03-10 09:09:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 9/9 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-03 finished in 3522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 13 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Performed 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 21 place count 13 transition count 9
Applied a total of 21 rules in 6 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-10 09:09:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants in 37 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 39 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/25 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 6
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 6 place count 9 transition count 6
Applied a total of 6 rules in 1 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-10 09:09:22] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 09:09:22] [INFO ] Invariant cache hit.
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants and state equation in 28 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 : 9/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 110 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s2 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-04 finished in 267 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||(p1 U p2)||X((G(p3) U (!p0&&G(p3))))) U !p4))'
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 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-10 09:09:22] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 09:09:22] [INFO ] Invariant cache hit.
[2023-03-10 09:09:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-10 09:09:22] [INFO ] Invariant cache hit.
[2023-03-10 09:09:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 301 ms :[p4, (OR (NOT p3) p0), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p3), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p4, acceptance={0} source=0 dest: 0}, { cond=(AND p4 p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p4 p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(OR (LT s5 1) (LT s15 1)), p0:(AND (GEQ s2 1) (GEQ s14 1)), p2:(OR (GEQ s19 1) (AND (GEQ s5 1) (GEQ s15 1))), p1:(GEQ s18 1), p3:(GEQ s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2578 reset in 118 ms.
Product exploration explored 100000 steps with 2591 reset in 131 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p4 (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X p4), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p4)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (NOT (AND p4 p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p4 p0 (NOT p2) (NOT p1))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2193 ms. Reduced automaton from 7 states, 21 edges and 5 AP (stutter sensitive) to 7 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[p4, (OR (NOT p3) p0), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p3), (NOT p2), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-10 09:09:25] [INFO ] Invariant cache hit.
[2023-03-10 09:09:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:25] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:4
[2023-03-10 09:09:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-10 09:09:26] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-10 09:09:26] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-10 09:09:26] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
Fused 10 Parikh solutions to 3 different solutions.
Finished Parikh walk after 78 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=78 )
Parikh walk visited 4 properties in 290 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X p4), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p4)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (NOT (AND p4 p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p4 p0 (NOT p2) (NOT p1))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (G (NOT (AND p1 (NOT p2) p0 p3))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (G (NOT (AND p1 (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 p3))), (G (NOT (AND p1 (NOT p2) (NOT p0) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (AND p0 p3)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p3)), (F (NOT p4)), (F (AND p1 (NOT p2) p0 p4)), (F (AND (NOT p1) (NOT p2) p0 p4)), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 36 factoid took 2918 ms. Reduced automaton from 7 states, 21 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (AND p0 p1 p4) (AND (NOT p3) p4) (AND p2 p4)), (OR (NOT p3) (AND p0 p2)), (OR (NOT p3) p2), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 223 ms :[(OR (AND p0 p1 p4) (AND (NOT p3) p4) (AND p2 p4)), (OR (NOT p3) (AND p0 p2)), (OR (NOT p3) p2), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
[2023-03-10 09:09:29] [INFO ] Invariant cache hit.
[2023-03-10 09:09:29] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:29] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-10 09:09:29] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 09:09:29] [INFO ] Added : 7 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (AND (NOT p3) p4)
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 09:09:29] [INFO ] Invariant cache hit.
[2023-03-10 09:09:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 09:09:29] [INFO ] Invariant cache hit.
[2023-03-10 09:09:29] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-10 09:09:29] [INFO ] Invariant cache hit.
[2023-03-10 09:09:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p4 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p2 p4) (AND (NOT p3) p4))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) p4))), (X (NOT (AND p1 p0 (NOT p2) p4))), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p2 p4) (AND (NOT p3) p4)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p4)))), (X (X (NOT (AND p1 p0 (NOT p2) p4)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1184 ms. Reduced automaton from 5 states, 11 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(OR (AND p0 p1 p4) (AND (NOT p3) p4) (AND p2 p4)), (OR (NOT p3) (AND p0 p2)), (OR (NOT p3) p2), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 09:09:31] [INFO ] Invariant cache hit.
[2023-03-10 09:09:31] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:31] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-10 09:09:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:31] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-10 09:09:31] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-10 09:09:31] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 88 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=88 )
Parikh walk visited 3 properties in 262 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p4 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p2 p4) (AND (NOT p3) p4))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) p4))), (X (NOT (AND p1 p0 (NOT p2) p4))), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p2 p4) (AND (NOT p3) p4)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p4)))), (X (X (NOT (AND p1 p0 (NOT p2) p4)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND (NOT p1) (NOT p2)))), (G (OR (NOT p3) p2))]
False Knowledge obtained : [(F p3), (F (AND p3 p0 p2)), (F (AND p3 (NOT p0) p2)), (F (NOT (OR (AND p4 (NOT p3)) (AND p4 p2)))), (F (AND p4 p0 p1 (NOT p2))), (F (AND p4 p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p3 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 20 factoid took 1453 ms. Reduced automaton from 5 states, 11 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 192 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
[2023-03-10 09:09:33] [INFO ] Invariant cache hit.
[2023-03-10 09:09:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:33] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-10 09:09:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:33] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-10 09:09:33] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 09:09:33] [INFO ] Added : 15 causal constraints over 3 iterations in 21 ms. Result :sat
Could not prove EG p4
Stuttering acceptance computed with spot in 236 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Product exploration explored 100000 steps with 2630 reset in 150 ms.
Product exploration explored 100000 steps with 2565 reset in 160 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 2 place count 21 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 6 rules in 4 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 09:09:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 09:09:34] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 09:09:34] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 18/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 21/21 places, 18/18 transitions.
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 09:09:34] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 09:09:34] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 09:09:34] [INFO ] Invariant cache hit.
[2023-03-10 09:09:34] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-10 09:09:34] [INFO ] Invariant cache hit.
[2023-03-10 09:09:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 119 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-05 finished in 12308 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(!p1)||F(p2))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 09:09:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 09:09:35] [INFO ] Implicit Places using invariants in 29 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (LT s15 1) (OR (LT s4 1) (LT s18 1))), p1:(GEQ s15 1), p0:(AND (LT s15 1) (OR (LT s0 1) (LT s13 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Product exploration explored 100000 steps with 50000 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-06 finished in 568 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(p1)))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 09:09:35] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 09:09:35] [INFO ] Implicit Places using invariants in 36 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 37 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s17 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1339 reset in 102 ms.
Product exploration explored 100000 steps with 1329 reset in 121 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 (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Finished Best-First random walk after 541 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=270 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 09:09:36] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:36] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:36] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 09:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:36] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-10 09:09:36] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 09:09:36] [INFO ] Added : 13 causal constraints over 3 iterations in 19 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 11
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 16 place count 13 transition count 8
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 11 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 9 transition count 6
Applied a total of 24 rules in 5 ms. Remains 9 /21 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-10 09:09:36] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:36] [INFO ] Implicit Places using invariants in 25 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/21 places, 6/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 33 ms. Remains : 8/21 places, 6/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 36 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 138 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2023-03-10 09:09:36] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-10 09:09:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:36] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-10 09:09:36] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 09:09:36] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7462 reset in 70 ms.
Product exploration explored 100000 steps with 7524 reset in 88 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 09:09:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-07 finished in 1681 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 4 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-10 09:09:37] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants in 31 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 33 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 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-10 09:09:37] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 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 83 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 10231 reset in 60 ms.
Product exploration explored 100000 steps with 10161 reset in 79 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 109 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 36 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 137 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:37] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-10 09:09:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:37] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-10 09:09:37] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 09:09:37] [INFO ] Added : 2 causal constraints over 1 iterations in 6 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 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 09:09:37] [INFO ] Invariant cache hit.
[2023-03-10 09:09:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-10 09:09:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:09:38] [INFO ] Invariant cache hit.
[2023-03-10 09:09:38] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 112 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 183 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 57 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 1) seen :0
Finished Best-First random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 210 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2023-03-10 09:09:38] [INFO ] Invariant cache hit.
[2023-03-10 09:09:38] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-10 09:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:38] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-10 09:09:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:38] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-10 09:09:38] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 09:09:38] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10288 reset in 62 ms.
Product exploration explored 100000 steps with 10200 reset in 75 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-10 09:09:38] [INFO ] Invariant cache hit.
[2023-03-10 09:09:38] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 09:09:38] [INFO ] Invariant cache hit.
[2023-03-10 09:09:38] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-10 09:09:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:09:38] [INFO ] Invariant cache hit.
[2023-03-10 09:09:38] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-08 finished in 1706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 09:09:38] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:38] [INFO ] Implicit Places using invariants in 31 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 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 5 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 39 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-10 finished in 217 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 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-10 09:09:39] [INFO ] Invariant cache hit.
[2023-03-10 09:09:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 09:09:39] [INFO ] Invariant cache hit.
[2023-03-10 09:09:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-10 09:09:39] [INFO ] Invariant cache hit.
[2023-03-10 09:09:39] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-11 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:(AND (LT s18 1) (OR (LT s3 1) (LT s14 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 69 ms.
Product exploration explored 100000 steps with 33333 reset in 81 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-11 finished in 429 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)&&(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-10 09:09:39] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 09:09:39] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 09:09:39] [INFO ] Invariant cache hit.
[2023-03-10 09:09:39] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-10 09:09:39] [INFO ] Invariant cache hit.
[2023-03-10 09:09:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 111 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s11 1) (LT s17 1)), p2:(LT s18 1), p1:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 40023 reset in 101 ms.
Product exploration explored 100000 steps with 40023 reset in 119 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 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 957 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 09:09:41] [INFO ] Invariant cache hit.
[2023-03-10 09:09:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:09:41] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 09:09:41] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-10 09:09:41] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 09:09:41] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 09:09:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:41] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 09:09:41] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 09:09:41] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 09:09:41] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 47 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=23 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1190 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 09:09:43] [INFO ] Invariant cache hit.
[2023-03-10 09:09:43] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-10 09:09:43] [INFO ] Invariant cache hit.
[2023-03-10 09:09:43] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-10 09:09:43] [INFO ] Invariant cache hit.
[2023-03-10 09:09:43] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105 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 p0 p2 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1016 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-10 09:09:44] [INFO ] Invariant cache hit.
[2023-03-10 09:09:44] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:44] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 09:09:44] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-10 09:09:44] [INFO ] After 44ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 09:09:44] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 09:09:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:44] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 09:09:44] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 09:09:44] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 09:09:44] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 52 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1161 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 40041 reset in 102 ms.
Product exploration explored 100000 steps with 39993 reset in 119 ms.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-10 09:09:46] [INFO ] Invariant cache hit.
[2023-03-10 09:09:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 09:09:46] [INFO ] Invariant cache hit.
[2023-03-10 09:09:47] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-10 09:09:47] [INFO ] Invariant cache hit.
[2023-03-10 09:09:47] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-12 finished in 7499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((X(X(F(p1)))&&G(!p0))||G(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 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.
[2023-03-10 09:09:47] [INFO ] Invariant cache hit.
[2023-03-10 09:09:47] [INFO ] Implicit Places using invariants in 25 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 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 29 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 3}, { cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(GEQ s12 1), p1:(OR (LT s11 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5570 reset in 105 ms.
Product exploration explored 100000 steps with 5315 reset in 123 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 7 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 4) seen :0
Finished Best-First random walk after 66 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 414 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 09:09:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 09:09:49] [INFO ] Invariant cache hit.
[2023-03-10 09:09:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-10 09:09:49] [INFO ] Invariant cache hit.
[2023-03-10 09:09:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 4) seen :0
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2965 reset in 100 ms.
Product exploration explored 100000 steps with 2837 reset in 121 ms.
Applying partial POR strategy [false, false, true, false, false, false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 17 transition count 14
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 8 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-10 09:09:51] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-10 09:09:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 17/21 places, 14/18 transitions.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-10 09:09:51] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-10 09:09:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-10 09:09:51] [INFO ] Invariant cache hit.
[2023-03-10 09:09:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-03-10 09:09:51] [INFO ] Invariant cache hit.
[2023-03-10 09:09:51] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-13 finished in 4210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 13 place count 17 transition count 10
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 3 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-10 09:09:51] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-10 09:09:51] [INFO ] Implicit Places using invariants in 38 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 8/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 11 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 6
Applied a total of 4 rules in 2 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-10 09:09:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:09:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 09:09:51] [INFO ] Invariant cache hit.
[2023-03-10 09:09:51] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 65 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 112 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3931 reset in 154 ms.
Stack based approach found an accepted trace after 358 steps with 16 reset with depth 16 and stack size 16 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-15 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0||G(p1))) U p2))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||(p1 U p2)||X((G(p3) U (!p0&&G(p3))))) U !p4))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N2000P0-LTLFireability-05
Stuttering acceptance computed with spot in 394 ms :[p4, (OR (NOT p3) p0), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p3), (NOT p2), (AND (NOT p2) (NOT p3))]
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 2 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 19 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 19 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 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 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Applied a total of 16 rules in 3 ms. Remains 15 /25 variables (removed 10) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 15 cols
[2023-03-10 09:09:52] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-10 09:09:52] [INFO ] Implicit Places using invariants in 28 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/25 places, 12/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 33 ms. Remains : 14/25 places, 12/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p4, acceptance={0} source=0 dest: 0}, { cond=(AND p4 p0 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p4 p0 (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p3), acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2) p1 p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1 p3), acceptance={0} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(OR (LT s4 1) (LT s11 1)), p0:(AND (GEQ s2 1) (GEQ s10 1)), p2:(OR (GEQ s13 1) (AND (GEQ s4 1) (GEQ s11 1))), p1:(GEQ s12 1), p3:(GEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5679 reset in 101 ms.
Product exploration explored 100000 steps with 5762 reset in 124 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 p4 (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X p4), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p4)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (NOT (AND p4 p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p4 p0 (NOT p2) (NOT p1))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 2397 ms. Reduced automaton from 7 states, 21 edges and 5 AP (stutter sensitive) to 7 states, 21 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 371 ms :[p4, (OR (NOT p3) p0), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p2))), true, (NOT p3), (NOT p2), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 12 rows 14 cols
[2023-03-10 09:09:55] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-10 09:09:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:55] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:4
[2023-03-10 09:09:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:55] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-10 09:09:55] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-10 09:09:55] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :4
Fused 10 Parikh solutions to 3 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=42 )
Parikh walk visited 4 properties in 766 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X p4), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (NOT (AND p0 (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3))), (X (NOT (AND (NOT p0) (NOT p2) p1 p3))), (X (NOT (AND p4 p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p4)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) p1 p3)))), (X (X (NOT (AND p4 p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) p3)))), (X (X (NOT (AND p4 p0 (NOT p2) (NOT p1))))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1) p3)))), (G (NOT (AND p1 (NOT p2) p0 p3))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0) p3))), (G (NOT (AND p1 (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) p3))), (G (NOT (AND (NOT p1) (NOT p2) p0 p3))), (G (NOT (AND p1 (NOT p2) (NOT p0) p3)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F p3), (F (AND p0 p3)), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p0) p3)), (F (NOT p4)), (F (AND p1 (NOT p2) p0 p4)), (F (AND (NOT p1) (NOT p2) p0 p4)), (F (AND p1 (NOT p2) (NOT p3)))]
Knowledge based reduction with 36 factoid took 2514 ms. Reduced automaton from 7 states, 21 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(OR (AND p0 p1 p4) (AND (NOT p3) p4) (AND p2 p4)), (OR (NOT p3) (AND p0 p2)), (OR (NOT p3) p2), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
Stuttering acceptance computed with spot in 212 ms :[(OR (AND p0 p1 p4) (AND (NOT p3) p4) (AND p2 p4)), (OR (NOT p3) (AND p0 p2)), (OR (NOT p3) p2), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
[2023-03-10 09:09:59] [INFO ] Invariant cache hit.
[2023-03-10 09:09:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:59] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 09:09:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:09:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 09:09:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:09:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-10 09:09:59] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 09:09:59] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p3) p4)
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 09:09:59] [INFO ] Invariant cache hit.
[2023-03-10 09:09:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 09:09:59] [INFO ] Invariant cache hit.
[2023-03-10 09:09:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-10 09:09:59] [INFO ] Invariant cache hit.
[2023-03-10 09:09:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77 ms. Remains : 14/14 places, 12/12 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 p2) p4 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p2 p4) (AND (NOT p3) p4))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) p4))), (X (NOT (AND p1 p0 (NOT p2) p4))), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p2 p4) (AND (NOT p3) p4)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p4)))), (X (X (NOT (AND p1 p0 (NOT p2) p4)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 1130 ms. Reduced automaton from 5 states, 11 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (AND p0 p1 p4) (AND (NOT p3) p4) (AND p2 p4)), (OR (NOT p3) (AND p0 p2)), (OR (NOT p3) p2), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2)))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 09:10:01] [INFO ] Invariant cache hit.
[2023-03-10 09:10:01] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-10 09:10:01] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-10 09:10:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-10 09:10:01] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-10 09:10:01] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-10 09:10:01] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 33 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=33 )
Parikh walk visited 3 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p4 (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (AND p2 p4) (AND (NOT p3) p4))), (X (NOT (AND p0 p2 p3))), (X (NOT (AND (NOT p1) p0 (NOT p2) p4))), (X (NOT (AND p1 p0 (NOT p2) p4))), (X (NOT p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (AND (NOT p1) (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (AND p2 p4) (AND (NOT p3) p4)))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p0 p2 p3)))), (X (X (OR p2 (NOT p3)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p4)))), (X (X (NOT (AND p1 p0 (NOT p2) p4)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (X (X (AND (NOT p1) (NOT p2)))), (G (OR (NOT p3) p2))]
False Knowledge obtained : [(F p3), (F (AND p3 p0 p2)), (F (AND p3 (NOT p0) p2)), (F (NOT (OR (AND p4 (NOT p3)) (AND p4 p2)))), (F (AND p4 p0 p1 (NOT p2))), (F (AND p4 p0 (NOT p1) (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND p3 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 20 factoid took 1384 ms. Reduced automaton from 5 states, 11 edges and 5 AP (stutter sensitive) to 5 states, 11 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 178 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
[2023-03-10 09:10:02] [INFO ] Invariant cache hit.
[2023-03-10 09:10:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 09:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 09:10:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 09:10:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 09:10:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-10 09:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 09:10:03] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-10 09:10:03] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-10 09:10:03] [INFO ] Added : 10 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG p4
Stuttering acceptance computed with spot in 200 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Product exploration explored 100000 steps with 5677 reset in 112 ms.
Product exploration explored 100000 steps with 5658 reset in 132 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 176 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 09:10:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 09:10:03] [INFO ] Invariant cache hit.
[2023-03-10 09:10:03] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33 ms. Remains : 14/14 places, 12/12 transitions.
Support contains 6 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 14 /14 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2023-03-10 09:10:03] [INFO ] Invariant cache hit.
[2023-03-10 09:10:03] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 09:10:03] [INFO ] Invariant cache hit.
[2023-03-10 09:10:03] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-10 09:10:03] [INFO ] Invariant cache hit.
[2023-03-10 09:10:03] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 14/14 places, 12/12 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-05 finished in 12024 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(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&X(p0)&&(X(!p1) U ((p2&&X(!p1))||X(G(!p1))))))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N2000P0-LTLFireability-12
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 9 place count 19 transition count 12
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 15 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 14 transition count 10
Applied a total of 19 rules in 5 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-10 09:10:04] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-10 09:10:04] [INFO ] Implicit Places using invariants in 23 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/25 places, 10/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 31 ms. Remains : 13/25 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s11 1)), p2:(LT s12 1), p1:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 39603 reset in 88 ms.
Product exploration explored 100000 steps with 39608 reset in 106 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 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 905 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4001 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 13 cols
[2023-03-10 09:10:05] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-10 09:10:06] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-10 09:10:06] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 09:10:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 09:10:06] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-10 09:10:06] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-10 09:10:06] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 110 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1135 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 09:10:07] [INFO ] Invariant cache hit.
[2023-03-10 09:10:07] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 09:10:07] [INFO ] Invariant cache hit.
[2023-03-10 09:10:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-10 09:10:07] [INFO ] Invariant cache hit.
[2023-03-10 09:10:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 13/13 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 915 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Incomplete random walk after 12011 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=4003 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-10 09:10:08] [INFO ] Invariant cache hit.
[2023-03-10 09:10:08] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-10 09:10:08] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-10 09:10:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-10 09:10:09] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-10 09:10:09] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-10 09:10:09] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 6 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (AND (NOT p0) p1)), (F p1), (F (AND p0 p1 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 19 factoid took 1328 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter sensitive) to 5 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 39733 reset in 87 ms.
Product exploration explored 100000 steps with 39596 reset in 103 ms.
Support contains 5 out of 13 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13/13 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 13 /13 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-10 09:10:11] [INFO ] Invariant cache hit.
[2023-03-10 09:10:11] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 09:10:11] [INFO ] Invariant cache hit.
[2023-03-10 09:10:11] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-10 09:10:11] [INFO ] Invariant cache hit.
[2023-03-10 09:10:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 13/13 places, 10/10 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-12 finished in 7293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((X(X(F(p1)))&&G(!p0))||G(F(p1))))))'
[2023-03-10 09:10:11] [INFO ] Flatten gal took : 5 ms
[2023-03-10 09:10:11] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-10 09:10:11] [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 58619 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3823/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-00
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-03
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-05
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-07
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-08
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-12
Could not compute solution for formula : ClientsAndServers-PT-N2000P0-LTLFireability-13

BK_STOP 1678439413191

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ClientsAndServers-PT-N2000P0-LTLFireability-00
ltl formula formula --ltl=/tmp/3823/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3823/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3823/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3823/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3823/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ClientsAndServers-PT-N2000P0-LTLFireability-03
ltl formula formula --ltl=/tmp/3823/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3823/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3823/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3823/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3823/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x562d103c53f4]
1: pnml2lts-mc(+0xa2496) [0x562d103c5496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fdac71b8140]
3: pnml2lts-mc(+0x405b30) [0x562d10728b30]
4: pnml2lts-mc(+0x16b3f9) [0x562d1048e3f9]
5: pnml2lts-mc(+0x164ac4) [0x562d10487ac4]
6: pnml2lts-mc(+0x272e0a) [0x562d10595e0a]
7: pnml2lts-mc(+0xb61f0) [0x562d103d91f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fdac700b4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fdac700b67a]
10: pnml2lts-mc(+0xa1581) [0x562d103c4581]
11: pnml2lts-mc(+0xa1910) [0x562d103c4910]
12: pnml2lts-mc(+0xa32a2) [0x562d103c62a2]
13: pnml2lts-mc(+0xa50f4) [0x562d103c80f4]
14: pnml2lts-mc(+0xa516b) [0x562d103c816b]
15: pnml2lts-mc(+0x3f34b3) [0x562d107164b3]
16: pnml2lts-mc(+0x7c63d) [0x562d1039f63d]
17: pnml2lts-mc(+0x67d86) [0x562d1038ad86]
18: pnml2lts-mc(+0x60a8a) [0x562d10383a8a]
19: pnml2lts-mc(+0x5eb15) [0x562d10381b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fdac6ff3d0a]
21: pnml2lts-mc(+0x6075e) [0x562d1038375e]
ltl formula name ClientsAndServers-PT-N2000P0-LTLFireability-08
ltl formula formula --ltl=/tmp/3823/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3823/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3823/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3823/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3823/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name ClientsAndServers-PT-N2000P0-LTLFireability-12
ltl formula formula --ltl=/tmp/3823/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3823/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3823/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3823/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3823/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5630771c63f4]
1: pnml2lts-mc(+0xa2496) [0x5630771c6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f575d95d140]
3: pnml2lts-mc(+0x405be5) [0x563077529be5]
4: pnml2lts-mc(+0x16b3f9) [0x56307728f3f9]
5: pnml2lts-mc(+0x164ac4) [0x563077288ac4]
6: pnml2lts-mc(+0x272e0a) [0x563077396e0a]
7: pnml2lts-mc(+0xb61f0) [0x5630771da1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f575d7b04d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f575d7b067a]
10: pnml2lts-mc(+0xa1581) [0x5630771c5581]
11: pnml2lts-mc(+0xa1910) [0x5630771c5910]
12: pnml2lts-mc(+0xa32a2) [0x5630771c72a2]
13: pnml2lts-mc(+0xa50f4) [0x5630771c90f4]
14: pnml2lts-mc(+0xa516b) [0x5630771c916b]
15: pnml2lts-mc(+0x3f34b3) [0x5630775174b3]
16: pnml2lts-mc(+0x7c63d) [0x5630771a063d]
17: pnml2lts-mc(+0x67d86) [0x56307718bd86]
18: pnml2lts-mc(+0x60a8a) [0x563077184a8a]
19: pnml2lts-mc(+0x5eb15) [0x563077182b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f575d798d0a]
21: pnml2lts-mc(+0x6075e) [0x56307718475e]
ltl formula name ClientsAndServers-PT-N2000P0-LTLFireability-13
ltl formula formula --ltl=/tmp/3823/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25 places, 18 transitions and 54 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3823/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3823/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3823/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3823/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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