Execution Chart

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

Trace from the execution

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

--------------------
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 1678274654122

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N2000P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 11:24:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 11:24:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:24:17] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-08 11:24:17] [INFO ] Transformed 25 places.
[2023-03-08 11:24:17] [INFO ] Transformed 18 transitions.
[2023-03-08 11:24:17] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 13 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-08 11:24:17] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-08 11:24:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-08 11:24:17] [INFO ] Invariant cache hit.
[2023-03-08 11:24:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-08 11:24:17] [INFO ] Invariant cache hit.
[2023-03-08 11:24:17] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-08 11:24:18] [INFO ] Flatten gal took : 25 ms
[2023-03-08 11:24:18] [INFO ] Flatten gal took : 7 ms
[2023-03-08 11:24:18] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=484 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-08 11:24:18] [INFO ] Invariant cache hit.
[2023-03-08 11:24:18] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-08 11:24:18] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-08 11:24:18] [INFO ] After 23ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 11:24:18] [INFO ] After 34ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 11:24:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 264302 steps, including 0 resets, run visited all 1 properties in 819 ms. (steps per millisecond=322 )
Parikh walk visited 1 properties in 820 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 17 ms. Remains 13 /25 variables (removed 12) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 11:24:19] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 11:24:20] [INFO ] Implicit Places using invariants in 278 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 282 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-08 11:24:20] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 11:24:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 11:24:20] [INFO ] Invariant cache hit.
[2023-03-08 11:24:20] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 8/25 places, 7/18 transitions.
Stuttering acceptance computed with spot in 314 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 201 reset in 505 ms.
Product exploration explored 100000 steps with 16 reset in 297 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 130 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 72 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=0 )
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 154 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 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-08 11:24:21] [INFO ] Invariant cache hit.
[2023-03-08 11:24:22] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:22] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-08 11:24:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:22] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-08 11:24:22] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:24:22] [INFO ] Added : 2 causal constraints over 1 iterations in 10 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 2 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 11:24:22] [INFO ] Invariant cache hit.
[2023-03-08 11:24:22] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 11:24:22] [INFO ] Invariant cache hit.
[2023-03-08 11:24:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 11:24:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:24:22] [INFO ] Invariant cache hit.
[2023-03-08 11:24:22] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 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 273 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 102 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 234 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
[2023-03-08 11:24:23] [INFO ] Invariant cache hit.
[2023-03-08 11:24:23] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:23] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 11:24:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 11:24:23] [INFO ] Computed and/alt/rep : 6/6/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:24:23] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 197 reset in 198 ms.
Product exploration explored 100000 steps with 1 reset in 487 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-08 11:24:23] [INFO ] Invariant cache hit.
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 11:24:24] [INFO ] Invariant cache hit.
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-08 11:24:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:24:24] [INFO ] Invariant cache hit.
[2023-03-08 11:24:24] [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 78 ms. Remains : 8/8 places, 7/7 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-00 finished in 4257 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-08 11:24:24] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 84 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 98 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 157 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 5 ms. Remains 9 /25 variables (removed 16) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 11:24:24] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants in 29 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 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-08 11:24:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 11:24:24] [INFO ] Invariant cache hit.
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 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 93 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 38 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 125 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-02 finished in 271 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 10 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:24:24] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants in 43 ms returned [7, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 47 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 5 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-08 11:24:24] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 11:24:24] [INFO ] Invariant cache hit.
[2023-03-08 11:24:24] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 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 140 ms. Remains : 9/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 143 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 23268 reset in 164 ms.
Product exploration explored 100000 steps with 23323 reset in 180 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 502 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 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Finished Best-First random walk after 65 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=21 )
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 565 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 107 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 106 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-08 11:24:26] [INFO ] Invariant cache hit.
[2023-03-08 11:24:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-08 11:24:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-08 11:24:26] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:24:26] [INFO ] Added : 3 causal constraints over 1 iterations in 12 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-08 11:24:26] [INFO ] Invariant cache hit.
[2023-03-08 11:24:26] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 11:24:26] [INFO ] Invariant cache hit.
[2023-03-08 11:24:26] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-08 11:24:26] [INFO ] Invariant cache hit.
[2023-03-08 11:24:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 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 273 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 273 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1715 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 2) seen :0
Finished Best-First random walk after 807 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=269 )
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 326 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 105 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2023-03-08 11:24:28] [INFO ] Invariant cache hit.
[2023-03-08 11:24:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 11:24:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:28] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 11:24:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 11:24:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:28] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-08 11:24:28] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:24:28] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 102 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 15101 reset in 146 ms.
Product exploration explored 100000 steps with 15147 reset in 163 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 101 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 3 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 11:24:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2023-03-08 11:24:29] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 11:24:29] [INFO ] Dead Transitions using invariants and state equation in 35 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 50 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 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-08 11:24:29] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 11:24:29] [INFO ] Invariant cache hit.
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2023-03-08 11:24:29] [INFO ] Invariant cache hit.
[2023-03-08 11:24:29] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103 ms. Remains : 9/9 places, 8/8 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-03 finished in 4816 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 5 ms. Remains 13 /25 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 11:24:29] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants in 40 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 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 3 ms. Remains 9 /12 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 11:24:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:24:29] [INFO ] Invariant cache hit.
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 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 123 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 49 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 176 ms.
Stack based approach found an accepted trace after 21 steps with 0 reset with depth 22 and stack size 22 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-04 finished in 368 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 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:24:29] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 11:24:29] [INFO ] Invariant cache hit.
[2023-03-08 11:24:29] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-08 11:24:29] [INFO ] Invariant cache hit.
[2023-03-08 11:24:29] [INFO ] Dead Transitions using invariants and state equation in 49 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 151 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 411 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 2599 reset in 184 ms.
Product exploration explored 100000 steps with 2609 reset in 214 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 3009 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 385 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 7 ms. (steps per millisecond=2285 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 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 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 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 18 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 11:24:34] [INFO ] Invariant cache hit.
[2023-03-08 11:24:34] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:34] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:4
[2023-03-08 11:24:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:34] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-08 11:24:34] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :4
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 11:24:34] [INFO ] After 154ms 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 71 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=71 )
Parikh walk visited 4 properties in 738 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 3744 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 324 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 305 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-08 11:24:39] [INFO ] Invariant cache hit.
[2023-03-08 11:24:39] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:39] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:24:39] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 11:24:39] [INFO ] Added : 7 causal constraints over 2 iterations in 22 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-08 11:24:39] [INFO ] Invariant cache hit.
[2023-03-08 11:24:39] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 11:24:39] [INFO ] Invariant cache hit.
[2023-03-08 11:24:39] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2023-03-08 11:24:39] [INFO ] Invariant cache hit.
[2023-03-08 11:24:39] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 148 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT 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 1674 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 317 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 6 ms. (steps per millisecond=2666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 11:24:42] [INFO ] Invariant cache hit.
[2023-03-08 11:24:42] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-08 11:24:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:42] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 11:24:42] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:24:42] [INFO ] After 120ms 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 101 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 391 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 1601 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 256 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 259 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
[2023-03-08 11:24:44] [INFO ] Invariant cache hit.
[2023-03-08 11:24:44] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:44] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:24:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:45] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-08 11:24:45] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 11:24:45] [INFO ] Added : 15 causal constraints over 3 iterations in 32 ms. Result :sat
Could not prove EG p4
Stuttering acceptance computed with spot in 253 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Product exploration explored 100000 steps with 2613 reset in 248 ms.
Product exploration explored 100000 steps with 2582 reset in 271 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 237 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 6 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:24:46] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:24:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:24:46] [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 58 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 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:24:46] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:24:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:24:46] [INFO ] Invariant cache hit.
[2023-03-08 11:24:46] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-08 11:24:46] [INFO ] Invariant cache hit.
[2023-03-08 11:24:46] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-05 finished in 16745 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 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:24:46] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 11:24:46] [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 211 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 133 ms.
Product exploration explored 100000 steps with 50000 reset in 158 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 259 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 838 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-08 11:24:47] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:24:47] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 153 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 1350 reset in 169 ms.
Product exploration explored 100000 steps with 1339 reset in 198 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 256 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 98 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 1) seen :0
Finished Best-First random walk after 428 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=428 )
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 190 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 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:24:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:24:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:48] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-08 11:24:48] [INFO ] Computed and/alt/rep : 17/18/17 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-08 11:24:48] [INFO ] Added : 13 causal constraints over 3 iterations in 30 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 6 ms. Remains 9 /21 variables (removed 12) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 11:24:48] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:24:48] [INFO ] Implicit Places using invariants in 32 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 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 40 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 154 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 40 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=6002 ) properties (out of 1) seen :0
Finished Best-First random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 124 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 11:24:49] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 11:24:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:49] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-08 11:24:49] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-08 11:24:49] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7498 reset in 69 ms.
Product exploration explored 100000 steps with 7519 reset in 86 ms.
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-08 11:24:49] [INFO ] Invariant cache hit.
[2023-03-08 11:24:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-08 11:24:49] [INFO ] Invariant cache hit.
[2023-03-08 11:24:49] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-08 11:24:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:24:49] [INFO ] Invariant cache hit.
[2023-03-08 11:24:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 8/8 places, 6/6 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-07 finished in 2155 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 6 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:24:49] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:24:49] [INFO ] Implicit Places using invariants in 34 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2023-03-08 11:24:49] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 11:24:49] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 11:24:49] [INFO ] Invariant cache hit.
[2023-03-08 11:24:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 50 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 10214 reset in 104 ms.
Product exploration explored 100000 steps with 10256 reset in 126 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 155 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 50 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 184 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2023-03-08 11:24:50] [INFO ] Invariant cache hit.
[2023-03-08 11:24:50] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:50] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 11:24:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 11:24:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:50] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 11:24:50] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:24:50] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 11:24:50] [INFO ] Invariant cache hit.
[2023-03-08 11:24:50] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 11:24:50] [INFO ] Invariant cache hit.
[2023-03-08 11:24:50] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-08 11:24:50] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:24:50] [INFO ] Invariant cache hit.
[2023-03-08 11:24:50] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 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 153 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 1) seen :0
Finished Best-First random walk after 10 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 11:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:51] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-08 11:24:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:24:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-08 11:24:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:24:51] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-08 11:24:51] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:24:51] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10222 reset in 99 ms.
Product exploration explored 100000 steps with 10261 reset in 128 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 3 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-08 11:24:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 6/6 places, 5/5 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-08 finished in 2119 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 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:24:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:24:51] [INFO ] Implicit Places using invariants in 46 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 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 185 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 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-08 11:24:51] [INFO ] Invariant cache hit.
[2023-03-08 11:24:51] [INFO ] Dead Transitions using invariants and state equation in 51 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 135 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 146 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 113 ms.
Product exploration explored 100000 steps with 33333 reset in 135 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 71 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 622 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(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 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:24:52] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 11:24:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 11:24:52] [INFO ] Invariant cache hit.
[2023-03-08 11:24:52] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-08 11:24:52] [INFO ] Invariant cache hit.
[2023-03-08 11:24:52] [INFO ] Dead Transitions using invariants and state equation in 46 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 142 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 295 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 39865 reset in 172 ms.
Product exploration explored 100000 steps with 39993 reset in 204 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 1305 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 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 28 ms. (steps per millisecond=357 ) 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 10000 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 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 11:24:54] [INFO ] Invariant cache hit.
[2023-03-08 11:24:54] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:54] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:24:54] [INFO ] After 37ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-08 11:24:54] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:24:54] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:24:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:55] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:24:55] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:24:55] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 11:24:55] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 90 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=45 )
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 1370 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 290 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 295 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 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:24:57] [INFO ] Invariant cache hit.
[2023-03-08 11:24:57] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-08 11:24:57] [INFO ] Invariant cache hit.
[2023-03-08 11:24:57] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-08 11:24:57] [INFO ] Invariant cache hit.
[2023-03-08 11:24:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 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 1451 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 307 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 5 ms. (steps per millisecond=3200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) 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
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 11:24:59] [INFO ] Invariant cache hit.
[2023-03-08 11:24:59] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:24:59] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:24:59] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-08 11:24:59] [INFO ] After 48ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:24:59] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:24:59] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:24:59] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 11:24:59] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:24:59] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 11:24:59] [INFO ] After 109ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 311 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=34 )
Parikh walk visited 3 properties in 8 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 1641 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 301 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 298 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 292 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 40058 reset in 173 ms.
Product exploration explored 100000 steps with 40069 reset in 202 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 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:25:02] [INFO ] Invariant cache hit.
[2023-03-08 11:25:02] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 11:25:02] [INFO ] Invariant cache hit.
[2023-03-08 11:25:02] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2023-03-08 11:25:02] [INFO ] Invariant cache hit.
[2023-03-08 11:25:02] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-12 finished in 10295 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-08 11:25:02] [INFO ] Invariant cache hit.
[2023-03-08 11:25:02] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 365 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 5536 reset in 179 ms.
Product exploration explored 100000 steps with 5162 reset in 211 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 464 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 313 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 6 ms. (steps per millisecond=2666 ) properties (out of 4) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=59 )
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 576 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 313 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 315 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-08 11:25:05] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:25:05] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 11:25:05] [INFO ] Invariant cache hit.
[2023-03-08 11:25:05] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-08 11:25:05] [INFO ] Invariant cache hit.
[2023-03-08 11:25:05] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 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 200 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 315 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 5 ms. (steps per millisecond=3200 ) properties (out of 4) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=29 )
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 327 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 305 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)]
Stuttering acceptance computed with spot in 311 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 2751 reset in 176 ms.
Product exploration explored 100000 steps with 2819 reset in 206 ms.
Applying partial POR strategy [false, false, true, false, false, false]
Stuttering acceptance computed with spot in 403 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 11 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-08 11:25:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-08 11:25:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:25:08] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 14/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68 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 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:25:08] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:25:08] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:25:08] [INFO ] Invariant cache hit.
[2023-03-08 11:25:08] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 11:25:08] [INFO ] Invariant cache hit.
[2023-03-08 11:25:08] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-13 finished in 5917 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 0 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-08 11:25:08] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 11:25:08] [INFO ] Implicit Places using invariants in 35 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 36 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 1 ms. Remains 9 /11 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-08 11:25:08] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:25:08] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 11:25:08] [INFO ] Invariant cache hit.
[2023-03-08 11:25:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
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 111 ms. Remains : 9/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 104 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 3911 reset in 239 ms.
Stack based approach found an accepted trace after 194 steps with 9 reset with depth 54 and stack size 54 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-15 finished in 474 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 375 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 5 ms. Remains 15 /25 variables (removed 10) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 15 cols
[2023-03-08 11:25:09] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:25:09] [INFO ] Implicit Places using invariants in 32 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 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 42 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 5667 reset in 174 ms.
Product exploration explored 100000 steps with 5724 reset in 204 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 3018 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 379 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 4 ms. (steps per millisecond=3001 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 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 13 ms. (steps per millisecond=77 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 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 15 ms. (steps per millisecond=66 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) 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 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 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 12 rows 14 cols
[2023-03-08 11:25:13] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 11:25:13] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:25:13] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:4
[2023-03-08 11:25:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:13] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :4
[2023-03-08 11:25:14] [INFO ] After 48ms 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-08 11:25:14] [INFO ] After 110ms 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 39 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 4 properties in 982 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 3522 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 311 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 302 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-08 11:25:19] [INFO ] Invariant cache hit.
[2023-03-08 11:25:19] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:25:19] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-08 11:25:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:25:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:25:19] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 11:25:19] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-08 11:25:19] [INFO ] Added : 3 causal constraints over 1 iterations in 11 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-08 11:25:19] [INFO ] Invariant cache hit.
[2023-03-08 11:25:19] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 11:25:19] [INFO ] Invariant cache hit.
[2023-03-08 11:25:19] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 11:25:19] [INFO ] Invariant cache hit.
[2023-03-08 11:25:19] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 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 1709 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 300 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 5 ms. (steps per millisecond=2401 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 11:25:21] [INFO ] Invariant cache hit.
[2023-03-08 11:25:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:21] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-08 11:25:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:25:21] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 11:25:21] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 11:25:21] [INFO ] After 97ms 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 24 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 3 properties in 1 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 2164 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 258 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Stuttering acceptance computed with spot in 259 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
[2023-03-08 11:25:24] [INFO ] Invariant cache hit.
[2023-03-08 11:25:24] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:25:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-08 11:25:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:25:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:25:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-08 11:25:24] [INFO ] Computed and/alt/rep : 11/11/11 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-08 11:25:24] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG p4
Stuttering acceptance computed with spot in 261 ms :[p4, (OR (NOT p3) p0), true, (NOT p3), (NOT p2)]
Product exploration explored 100000 steps with 5681 reset in 229 ms.
Product exploration explored 100000 steps with 5667 reset in 252 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 257 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-08 11:25:25] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:25:25] [INFO ] Invariant cache hit.
[2023-03-08 11:25:25] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 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-08 11:25:25] [INFO ] Invariant cache hit.
[2023-03-08 11:25:25] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 11:25:25] [INFO ] Invariant cache hit.
[2023-03-08 11:25:25] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 11:25:25] [INFO ] Invariant cache hit.
[2023-03-08 11:25:25] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 14/14 places, 12/12 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-05 finished in 16634 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 302 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 7 ms. Remains 14 /25 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 11:25:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:25:26] [INFO ] Implicit Places using invariants in 37 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 38 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 0 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 47 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 39731 reset in 163 ms.
Product exploration explored 100000 steps with 39549 reset in 192 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 1444 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 302 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 4 ms. (steps per millisecond=3001 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 10 rows 13 cols
[2023-03-08 11:25:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:25:29] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 11:25:29] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:25:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:29] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:25:29] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 11:25:29] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 66 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=66 )
Parikh walk visited 3 properties in 0 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 1670 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 295 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 290 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-08 11:25:31] [INFO ] Invariant cache hit.
[2023-03-08 11:25:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:25:31] [INFO ] Invariant cache hit.
[2023-03-08 11:25:31] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-08 11:25:31] [INFO ] Invariant cache hit.
[2023-03-08 11:25:31] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 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 1372 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 411 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 4 ms. (steps per millisecond=3001 ) properties (out of 9) 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 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) 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
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
Running SMT prover for 3 properties.
[2023-03-08 11:25:33] [INFO ] Invariant cache hit.
[2023-03-08 11:25:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:33] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 11:25:33] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:25:33] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 11:25:33] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 11:25:33] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 85 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=42 )
Parikh walk visited 3 properties in 1 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 1640 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 293 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 295 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 296 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 39690 reset in 170 ms.
Stack based approach found an accepted trace after 7850 steps with 3125 reset with depth 61 and stack size 61 in 15 ms.
Treatment of property ClientsAndServers-PT-N2000P0-LTLFireability-12 finished in 10307 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(((X(X(F(p1)))&&G(!p0))||G(F(p1))))))'
[2023-03-08 11:25:36] [INFO ] Flatten gal took : 7 ms
[2023-03-08 11:25:36] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-08 11:25:36] [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 79459 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N2000P0
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

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

FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ClientsAndServers-PT-N2000P0-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678274778455

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N2000P0-LTLFireability-00
lola: time limit : 514 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/514 28/32 ClientsAndServers-PT-N2000P0-LTLFireability-00 3983334 m, 796666 m/sec, 4765617 t fired, .

Time elapsed: 5 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 1 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 19 (type EXCL) for 18 ClientsAndServers-PT-N2000P0-LTLFireability-13
lola: time limit : 598 sec
lola: memory limit: 32 pages
lola: FINISHED task # 19 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-13
lola: result : false
lola: markings : 100022
lola: fired transitions : 100026
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 ClientsAndServers-PT-N2000P0-LTLFireability-12
lola: time limit : 718 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-12
lola: result : false
lola: markings : 364182
lola: fired transitions : 380424
lola: time used : 1.000000
lola: memory pages used : 3
lola: LAUNCH task # 10 (type EXCL) for 9 ClientsAndServers-PT-N2000P0-LTLFireability-07
lola: time limit : 897 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-07
lola: result : false
lola: markings : 100001
lola: fired transitions : 100001
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 ClientsAndServers-PT-N2000P0-LTLFireability-05
lola: time limit : 1196 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 4/1196 9/32 ClientsAndServers-PT-N2000P0-LTLFireability-05 1326843 m, 265368 m/sec, 1900122 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 9/1196 20/32 ClientsAndServers-PT-N2000P0-LTLFireability-05 3001098 m, 334851 m/sec, 4375376 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 14/1196 31/32 ClientsAndServers-PT-N2000P0-LTLFireability-05 4639753 m, 327731 m/sec, 6805228 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 7 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 1 0 0 1 0 0 0

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

Time elapsed: 30 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 21 (type EXCL) for 12 ClientsAndServers-PT-N2000P0-LTLFireability-08
lola: time limit : 1785 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
21 EG EXCL 5/1785 23/32 ClientsAndServers-PT-N2000P0-LTLFireability-08 5285077 m, 1057015 m/sec, 5285077 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: CANCELED task # 21 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
ClientsAndServers-PT-N2000P0-LTLFireability-08: F 0 0 0 0 1 0 1 0

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

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 7
lola: LAUNCH task # 4 (type EXCL) for 3 ClientsAndServers-PT-N2000P0-LTLFireability-03
lola: time limit : 3560 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLFireability-03
lola: result : true
lola: markings : 24001
lola: fired transitions : 47996
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 7

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLFireability-00: LTL unknown AGGR
ClientsAndServers-PT-N2000P0-LTLFireability-03: LTL true LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-05: LTL unknown AGGR
ClientsAndServers-PT-N2000P0-LTLFireability-07: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-08: F unknown AGGR
ClientsAndServers-PT-N2000P0-LTLFireability-12: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLFireability-13: LTL false LTL model checker


Time elapsed: 40 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-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 r071-smll-167814397900348"
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 ;