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-167814397900347.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814397900347
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N2000P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678274519416

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N2000P0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 11:22:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 11:22:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:22:02] [INFO ] Load time of PNML (sax parser for PT used): 29 ms
[2023-03-08 11:22:02] [INFO ] Transformed 25 places.
[2023-03-08 11:22:02] [INFO ] Transformed 18 transitions.
[2023-03-08 11:22:02] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 23 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 11:22:03] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-08 11:22:03] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-08 11:22:03] [INFO ] Invariant cache hit.
[2023-03-08 11:22:03] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-08 11:22:03] [INFO ] Invariant cache hit.
[2023-03-08 11:22:03] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 24/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 509 ms. Remains : 24/25 places, 18/18 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-03-08 11:22:03] [INFO ] Flatten gal took : 39 ms
[2023-03-08 11:22:04] [INFO ] Flatten gal took : 11 ms
[2023-03-08 11:22:04] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=347 ) properties (out of 28) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=12 ) properties (out of 26) seen :10
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=28 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-08 11:22:04] [INFO ] Invariant cache hit.
[2023-03-08 11:22:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 11:22:04] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:22:04] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-08 11:22:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-08 11:22:04] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:22:04] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-08 11:22:04] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 7 ms to minimize.
[2023-03-08 11:22:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2023-03-08 11:22:04] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 11:22:04] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 5482 ms.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 6 rules applied. Total rules applied 6 place count 23 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 18 transition count 11
Reduce places removed 2 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 21 place count 14 transition count 7
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 24 place count 11 transition count 7
Applied a total of 24 rules in 13 ms. Remains 11 /24 variables (removed 13) and now considering 7/18 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 11/24 places, 7/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2918582 steps, run timeout after 3001 ms. (steps per millisecond=972 ) properties seen :{}
Probabilistic random walk after 2918582 steps, saw 1553157 distinct states, run finished after 3002 ms. (steps per millisecond=972 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 11 cols
[2023-03-08 11:22:13] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:22:13] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:22:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-08 11:22:13] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:22:13] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
[2023-03-08 11:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-08 11:22:13] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 11:22:13] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 218 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 11/11 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 11:22:13] [INFO ] Invariant cache hit.
[2023-03-08 11:22:13] [INFO ] Implicit Places using invariants in 52 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 55 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 10/11 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 60 ms. Remains : 10/11 places, 7/7 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3182829 steps, run timeout after 3001 ms. (steps per millisecond=1060 ) properties seen :{}
Probabilistic random walk after 3182829 steps, saw 1679139 distinct states, run finished after 3006 ms. (steps per millisecond=1058 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:22:16] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-08 11:22:16] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:22:17] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 11:22:17] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:22:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2023-03-08 11:22:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-08 11:22:17] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 11:22:17] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 259 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 11:22:17] [INFO ] Invariant cache hit.
[2023-03-08 11:22:17] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 11:22:17] [INFO ] Invariant cache hit.
[2023-03-08 11:22:17] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-08 11:22:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:22:17] [INFO ] Invariant cache hit.
[2023-03-08 11:22:17] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 10/10 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 11:22:17] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-08 11:22:17] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:22:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:22:17] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:22:17] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 11:22:17] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 2 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:22:18] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 11:22:18] [INFO ] Implicit Places using invariants in 63 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s17 s18)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-00 finished in 605 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 X(p2))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:22:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:22:18] [INFO ] Implicit Places using invariants in 50 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ s0 s19), p2:(LEQ s5 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33483 reset in 517 ms.
Product exploration explored 100000 steps with 33374 reset in 266 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) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 682 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 6) 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 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:22:20] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 11:22:20] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:22:20] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:22:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:22:20] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:22:20] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 11:22:20] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 75320 steps, including 0 resets, run visited all 2 properties in 897 ms. (steps per millisecond=83 )
Parikh walk visited 2 properties in 896 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 995 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:22:23] [INFO ] Invariant cache hit.
[2023-03-08 11:22:23] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-08 11:22:23] [INFO ] Invariant cache hit.
[2023-03-08 11:22:23] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-08 11:22:23] [INFO ] Invariant cache hit.
[2023-03-08 11:22:23] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 165 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 904 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:22:24] [INFO ] Invariant cache hit.
[2023-03-08 11:22:24] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:22:24] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:22:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:22:24] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:22:24] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 11:22:24] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 76949 steps, including 0 resets, run visited all 2 properties in 815 ms. (steps per millisecond=94 )
Parikh walk visited 2 properties in 814 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 960 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33319 reset in 209 ms.
Product exploration explored 100000 steps with 33405 reset in 215 ms.
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:22:27] [INFO ] Invariant cache hit.
[2023-03-08 11:22:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-08 11:22:27] [INFO ] Invariant cache hit.
[2023-03-08 11:22:27] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-08 11:22:27] [INFO ] Invariant cache hit.
[2023-03-08 11:22:28] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-02 finished in 9430 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)&&((p0 U p1) U (p0&&X(G(p2))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:22:28] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-08 11:22:28] [INFO ] Implicit Places using invariants in 49 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 527 ms :[(OR (NOT p0) (NOT p2)), true, (NOT p0), (OR (NOT p0) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=p0, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={0} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(OR (AND p0 p2) (AND p1 p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 1}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ 1 s14), p1:(LEQ s3 s16), p2:(LEQ 3 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9475 reset in 287 ms.
Product exploration explored 100000 steps with 9331 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 1737 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(NOT p2), true, (OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 10 ms. (steps per millisecond=1600 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 20 cols
[2023-03-08 11:22:32] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-08 11:22:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-08 11:22:32] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 11:22:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:22:32] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-08 11:22:32] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 11:22:32] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 15998 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=1066 )
Parikh walk visited 6 properties in 739 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (NOT p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F p2), (F (OR (AND p1 p2) (AND p2 p0))), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 23 factoid took 2119 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(NOT p2), true, (OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 367 ms :[(NOT p2), true, (OR (NOT p0) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
[2023-03-08 11:22:35] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p1 p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) p0)), (F (NOT p0)), (F (AND p1 (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F p2), (F (OR (AND p1 p2) (AND p2 p0))), (F (AND (NOT p1) p2 (NOT p0))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 23 factoid took 944 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-03 finished in 8723 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)||G(p1))&&F((!p0||G(F(!p0)))))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:22:36] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:22:36] [INFO ] Implicit Places using invariants in 56 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 58 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ s11 s6), p0:(LEQ s1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-05 finished in 283 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||(G(p1)&&X(p0))))&&X(p2)))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-08 11:22:37] [INFO ] Invariant cache hit.
[2023-03-08 11:22:37] [INFO ] Implicit Places using invariants in 44 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (NOT p2)), true, (AND (NOT p0) p1), (AND p0 (NOT p1)), (NOT p0), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2)))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(OR p0 p1), acceptance={} source=0 dest: 4}, { cond=(OR p0 p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(OR p0 p1), acceptance={} source=4 dest: 4}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=5 dest: 1}]], initial=0, aps=[p0:(LEQ s17 s6), p1:(LEQ 3 s15), p2:(LEQ s19 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-06 finished in 376 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(((X(X((!p0&&G(F(p1)))))&&G(p1))||G((!p0&&F(p1)))))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 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 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 10 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2023-03-08 11:22:37] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:22:37] [INFO ] Implicit Places using invariants in 40 ms returned [9]
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/24 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:22:37] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:22:37] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 11:22:37] [INFO ] Invariant cache hit.
[2023-03-08 11:22:37] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 144 ms. Remains : 10/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 595 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (AND (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={1} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={1} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={1} source=6 dest: 7}, { cond=(NOT p0), acceptance={} source=6 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=7 dest: 1}, { cond=(AND p0 p1), acceptance={1} source=7 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 8}, { cond=true, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(GT 2 s8), p0:(OR (LEQ 3 s4) (LEQ 1 s2))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Stack based approach found an accepted trace after 73 steps with 1 reset with depth 69 and stack size 69 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-07 finished in 938 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||X(G(p1)))))||G(p2)))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:22:38] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:22:38] [INFO ] Implicit Places using invariants in 57 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 493 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (LEQ 1 s19) (LEQ s1 s20)), p2:(GT 3 s13), p0:(LEQ s1 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 308 ms.
Product exploration explored 100000 steps with 0 reset in 316 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 969 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:22:41] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-08 11:22:41] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 11:22:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:22:41] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-08 11:22:41] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-08 11:22:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-08 11:22:41] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 11:22:41] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 6669 ms.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 9 rules applied. Total rules applied 15 place count 15 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 18 place count 12 transition count 9
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 20 place count 11 transition count 8
Applied a total of 20 rules in 8 ms. Remains 11 /21 variables (removed 10) and now considering 8/18 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 11/21 places, 8/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 581548 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 581548 steps, saw 330474 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 11:22:51] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:22:51] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:22:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 11:22:51] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:22:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-08 11:22:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2023-03-08 11:22:51] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 11:22:51] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1542 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 11/11 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 11:22:53] [INFO ] Invariant cache hit.
[2023-03-08 11:22:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-08 11:22:53] [INFO ] Invariant cache hit.
[2023-03-08 11:22:53] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-08 11:22:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:22:53] [INFO ] Invariant cache hit.
[2023-03-08 11:22:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 11:22:53] [INFO ] Invariant cache hit.
[2023-03-08 11:22:53] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:22:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:22:53] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:22:53] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 11:22:53] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 17 factoid took 1109 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 325 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 321 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 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:22:54] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:22:55] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-08 11:22:55] [INFO ] Invariant cache hit.
[2023-03-08 11:22:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2023-03-08 11:22:55] [INFO ] Invariant cache hit.
[2023-03-08 11:22:55] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 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 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 949 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 11:22:56] [INFO ] Invariant cache hit.
[2023-03-08 11:22:56] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 11:22:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:22:56] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 11:22:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-08 11:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2023-03-08 11:22:56] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 11:22:57] [INFO ] After 159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 4175 ms.
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21/21 places, 18/18 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 10
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 11 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 21 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 10 transition count 7
Applied a total of 22 rules in 7 ms. Remains 10 /21 variables (removed 11) and now considering 7/18 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 10/21 places, 7/18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2903301 steps, run timeout after 3001 ms. (steps per millisecond=967 ) properties seen :{}
Probabilistic random walk after 2903301 steps, saw 1392935 distinct states, run finished after 3001 ms. (steps per millisecond=967 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:23:04] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:23:04] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:23:04] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 11:23:04] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:23:04] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2023-03-08 11:23:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-08 11:23:04] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-08 11:23:04] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 110 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 10/10 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 11:23:04] [INFO ] Invariant cache hit.
[2023-03-08 11:23:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 11:23:04] [INFO ] Invariant cache hit.
[2023-03-08 11:23:04] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-08 11:23:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:23:04] [INFO ] Invariant cache hit.
[2023-03-08 11:23:04] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 10/10 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 11:23:04] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 11:23:04] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:23:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:23:04] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:23:04] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-08 11:23:04] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 13 factoid took 1045 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 340 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 342 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 430 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 305 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 255 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 19 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 19 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 17 transition count 14
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 17 rules in 8 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2023-03-08 11:23:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2023-03-08 11:23:07] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-08 11:23:07] [INFO ] Dead Transitions using invariants and state equation in 29 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 44 ms. Remains : 17/21 places, 14/18 transitions.
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2023-03-08 11:23:07] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:23:07] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-08 11:23:07] [INFO ] Invariant cache hit.
[2023-03-08 11:23:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-08 11:23:08] [INFO ] Invariant cache hit.
[2023-03-08 11:23:08] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 21/21 places, 18/18 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-09 finished in 29688 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-08 11:23:08] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:23:08] [INFO ] Implicit Places using invariants in 50 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 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 53 ms. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 3 s13) (GT 1 s7))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Product exploration explored 100000 steps with 50000 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-11 finished in 748 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)) U X(X(p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-08 11:23:08] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-08 11:23:08] [INFO ] Implicit Places using invariants in 44 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 424 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), true, (NOT p0), p1]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 6}, { cond=(NOT p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (LEQ s19 s10) (LEQ s13 s1)), p0:(LEQ s19 s10)], 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, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-13 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U X(G(p2))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2023-03-08 11:23:09] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-08 11:23:09] [INFO ] Implicit Places using invariants in 41 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(GT 2 s20), p1:(GT 2 s16), p0:(LEQ 2 s19)], 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]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-14 finished in 295 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 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 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 12 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12 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 3 with 6 rules applied. Total rules applied 18 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 7 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2023-03-08 11:23:09] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:23:09] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 11:23:09] [INFO ] Invariant cache hit.
[2023-03-08 11:23:09] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-03-08 11:23:09] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:23:09] [INFO ] Invariant cache hit.
[2023-03-08 11:23:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/24 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 12/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-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:(GT s10 s8)], 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 0 reset in 168 ms.
Stack based approach found an accepted trace after 243 steps with 0 reset with depth 244 and stack size 244 in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-15 finished in 430 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 X(p2))))))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N2000P0-LTLCardinality-02
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 19 transition count 14
Applied a total of 9 rules in 6 ms. Remains 19 /24 variables (removed 5) and now considering 14/18 (removed 4) transitions.
// Phase 1: matrix 14 rows 19 cols
[2023-03-08 11:23:10] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-08 11:23:10] [INFO ] Implicit Places using invariants in 42 ms returned [13, 15]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 17/24 places, 14/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 17 transition count 13
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 16 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 15 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 14 transition count 11
Applied a total of 6 rules in 5 ms. Remains 14 /17 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 14 cols
[2023-03-08 11:23:10] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:23:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 11:23:10] [INFO ] Invariant cache hit.
[2023-03-08 11:23:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/24 places, 11/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 125 ms. Remains : 14/24 places, 11/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ s0 s12), p2:(LEQ s2 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33274 reset in 226 ms.
Product exploration explored 100000 steps with 33301 reset in 209 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) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 818 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:23:12] [INFO ] Invariant cache hit.
[2023-03-08 11:23:12] [INFO ] [Real]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-08 11:23:12] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:23:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:23:12] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:23:12] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 11:23:12] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 12028 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=633 )
Parikh walk visited 2 properties in 288 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 981 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 11:23:13] [INFO ] Invariant cache hit.
[2023-03-08 11:23:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-08 11:23:13] [INFO ] Invariant cache hit.
[2023-03-08 11:23:13] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2023-03-08 11:23:13] [INFO ] Invariant cache hit.
[2023-03-08 11:23:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114 ms. Remains : 14/14 places, 11/11 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 745 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 11:23:15] [INFO ] Invariant cache hit.
[2023-03-08 11:23:15] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:23:15] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:23:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:23:15] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:23:15] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-08 11:23:15] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 12028 steps, including 0 resets, run visited all 1 properties in 19 ms. (steps per millisecond=633 )
Parikh walk visited 2 properties in 291 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND p1 (NOT p2) (NOT p0))), (F p0), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 13 factoid took 1142 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 33471 reset in 193 ms.
Product exploration explored 100000 steps with 33289 reset in 183 ms.
Support contains 5 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 14 /14 variables (removed 0) and now considering 11/11 (removed 0) transitions.
[2023-03-08 11:23:17] [INFO ] Invariant cache hit.
[2023-03-08 11:23:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-08 11:23:17] [INFO ] Invariant cache hit.
[2023-03-08 11:23:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-08 11:23:17] [INFO ] Invariant cache hit.
[2023-03-08 11:23:17] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 14/14 places, 11/11 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-02 finished in 7859 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||X(G(p1)))))||G(p2)))'
Found a Lengthening insensitive property : ClientsAndServers-PT-N2000P0-LTLCardinality-09
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2)]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 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 5 rules applied. Total rules applied 5 place count 23 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 19 transition count 11
Reduce places removed 3 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 7 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2023-03-08 11:23:18] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 11:23:18] [INFO ] Implicit Places using invariants in 44 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/24 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 12 transition count 9
Applied a total of 2 rules in 3 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:23:18] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:23:18] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-08 11:23:18] [INFO ] Invariant cache hit.
[2023-03-08 11:23:18] [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 LI_LTL mode, iteration 2 : 12/24 places, 9/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 130 ms. Remains : 12/24 places, 9/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (LEQ 1 s10) (LEQ s1 s11)), p2:(GT 3 s8), p0:(LEQ s1 s11)], 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, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 220 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 912 ms. Reduced automaton from 7 states, 17 edges and 3 AP (stutter sensitive) to 7 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-08 11:23:20] [INFO ] Invariant cache hit.
[2023-03-08 11:23:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-08 11:23:20] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2023-03-08 11:23:20] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-08 11:23:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 11:23:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-08 11:23:20] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 11:23:20] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 5861 ms.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 9/9 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 8/9 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 11/12 places, 8/9 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 546283 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 546283 steps, saw 315704 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 11 cols
[2023-03-08 11:23:29] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:23:29] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:23:29] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 11:23:29] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:23:29] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-08 11:23:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-03-08 11:23:29] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 11:23:29] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1483 ms.
Support contains 4 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 11/11 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-08 11:23:31] [INFO ] Invariant cache hit.
[2023-03-08 11:23:31] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-08 11:23:31] [INFO ] Invariant cache hit.
[2023-03-08 11:23:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-08 11:23:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:23:31] [INFO ] Invariant cache hit.
[2023-03-08 11:23:31] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 11/11 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-08 11:23:31] [INFO ] Invariant cache hit.
[2023-03-08 11:23:31] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 11:23:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:23:31] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 11:23:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2023-03-08 11:23:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-08 11:23:31] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 11:23:31] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p0), (X (AND p2 p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0)), (X (X (AND p2 p0))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT p0)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p0) p2)), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2)))]
Knowledge based reduction with 17 factoid took 1249 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 334 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 335 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:23:33] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-08 11:23:33] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-08 11:23:33] [INFO ] Invariant cache hit.
[2023-03-08 11:23:33] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-08 11:23:33] [INFO ] Invariant cache hit.
[2023-03-08 11:23:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 12/12 places, 9/9 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 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 873 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 331 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 8) 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 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-08 11:23:35] [INFO ] Invariant cache hit.
[2023-03-08 11:23:35] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 11:23:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 11:23:35] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 11:23:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2023-03-08 11:23:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-08 11:23:35] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 11:23:35] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 4001 ms.
Support contains 3 out of 12 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 12/12 places, 9/9 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 11 transition count 8
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 10 transition count 7
Applied a total of 4 rules in 4 ms. Remains 10 /12 variables (removed 2) and now considering 7/9 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 10/12 places, 7/9 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3285247 steps, run timeout after 3001 ms. (steps per millisecond=1094 ) properties seen :{}
Probabilistic random walk after 3285247 steps, saw 1562899 distinct states, run finished after 3001 ms. (steps per millisecond=1094 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2023-03-08 11:23:42] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:23:42] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:23:42] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 11:23:42] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:23:42] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2023-03-08 11:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-08 11:23:42] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-08 11:23:42] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 174 ms.
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/10 places, 7/7 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10/10 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-08 11:23:42] [INFO ] Invariant cache hit.
[2023-03-08 11:23:42] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-08 11:23:42] [INFO ] Invariant cache hit.
[2023-03-08 11:23:42] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-08 11:23:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:23:42] [INFO ] Invariant cache hit.
[2023-03-08 11:23:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 10/10 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 8 transition count 6
Applied a total of 3 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/7 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 8 cols
[2023-03-08 11:23:42] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-08 11:23:42] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:23:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-08 11:23:42] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:23:42] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 11:23:42] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p2)), (X (X (AND p0 p2))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p2)), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 13 factoid took 1068 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 330 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 332 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 192 ms.
Product exploration explored 100000 steps with 0 reset in 245 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 329 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:23:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2023-03-08 11:23:45] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-08 11:23:45] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48 ms. Remains : 12/12 places, 9/9 transitions.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-03-08 11:23:45] [INFO ] Invariant cache hit.
[2023-03-08 11:23:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-08 11:23:45] [INFO ] Invariant cache hit.
[2023-03-08 11:23:45] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-08 11:23:45] [INFO ] Invariant cache hit.
[2023-03-08 11:23:45] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 12/12 places, 9/9 transitions.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-09 finished in 28067 ms.
[2023-03-08 11:23:45] [INFO ] Flatten gal took : 7 ms
[2023-03-08 11:23:46] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2023-03-08 11:23:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 52 arcs took 0 ms.
Total runtime 103289 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ClientsAndServers-PT-N2000P0
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678274642579

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:521
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 # 4 (type EXCL) for 3 ClientsAndServers-PT-N2000P0-LTLCardinality-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 17/32 ClientsAndServers-PT-N2000P0-LTLCardinality-09 2424549 m, 484909 m/sec, 5123143 t fired, .

Time elapsed: 5 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ClientsAndServers-PT-N2000P0-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLCardinality-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 32/32 ClientsAndServers-PT-N2000P0-LTLCardinality-09 4612622 m, 437614 m/sec, 10607750 t fired, .

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLCardinality-09 (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-LTLCardinality-02: LTL 0 1 0 0 1 0 0 0
ClientsAndServers-PT-N2000P0-LTLCardinality-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 ClientsAndServers-PT-N2000P0-LTLCardinality-02
lola: time limit : 3585 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ClientsAndServers-PT-N2000P0-LTLCardinality-02
lola: result : false
lola: markings : 124000
lola: fired transitions : 124000
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ClientsAndServers-PT-N2000P0-LTLCardinality-02: LTL false LTL model checker
ClientsAndServers-PT-N2000P0-LTLCardinality-09: LTL unknown AGGR


Time elapsed: 15 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="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ClientsAndServers-PT-N2000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-167814397900347"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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