Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r087-tall-171620522000327.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r087-tall-171620522000327
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 23:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 12 23:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 23:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 12 23:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 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 1716259890939

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N2000P0
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 02:51:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 02:51:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 02:51:32] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2024-05-21 02:51:32] [INFO ] Transformed 25 places.
[2024-05-21 02:51:32] [INFO ] Transformed 18 transitions.
[2024-05-21 02:51:32] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 9 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 02:51:32] [INFO ] Computed 5 invariants in 9 ms
[2024-05-21 02:51:32] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-21 02:51:32] [INFO ] Invariant cache hit.
[2024-05-21 02:51:32] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2024-05-21 02:51:32] [INFO ] Invariant cache hit.
[2024-05-21 02:51:32] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 372 ms. Remains : 22/25 places, 18/18 transitions.
Support contains 15 out of 22 places after structural reductions.
[2024-05-21 02:51:33] [INFO ] Flatten gal took : 14 ms
[2024-05-21 02:51:33] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:51:33] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 15 ms. (steps per millisecond=1066 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 23) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2024-05-21 02:51:33] [INFO ] Invariant cache hit.
[2024-05-21 02:51:33] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:33] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:12
[2024-05-21 02:51:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:33] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :11
[2024-05-21 02:51:33] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 4 ms to minimize.
[2024-05-21 02:51:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-21 02:51:33] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :11
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 02:51:33] [INFO ] After 190ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :11
Fused 14 Parikh solutions to 11 different solutions.
Finished Parikh walk after 196005 steps, including 0 resets, run visited all 3 properties in 1425 ms. (steps per millisecond=137 )
Parikh walk visited 9 properties in 8593 ms.
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 22/22 places, 18/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 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 19 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 19 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 14 transition count 10
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 13 transition count 9
Applied a total of 18 rules in 3480 ms. Remains 13 /22 variables (removed 9) and now considering 9/18 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3480 ms. Remains : 13/22 places, 9/18 transitions.
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Finished probabilistic random walk after 650432 steps, run visited all 2 properties in 964 ms. (steps per millisecond=674 )
Probabilistic random walk after 650432 steps, saw 385242 distinct states, run finished after 964 ms. (steps per millisecond=674 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 10 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&((X(!p1)&&F(p2))||X(G(!p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 02:51:47] [INFO ] Invariant cache hit.
[2024-05-21 02:51:47] [INFO ] Implicit Places using invariants in 44 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 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 54 ms. Remains : 21/22 places, 18/18 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 339 ms :[true, (NOT p1), (NOT p0), p1, (AND (NOT p2) p1), true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s15 s5), p0:(LEQ 3 s14), p2:(LEQ 2 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 274 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 (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 126 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 101982 steps, run visited all 1 properties in 128 ms. (steps per millisecond=796 )
Probabilistic random walk after 101982 steps, saw 74654 distinct states, run finished after 129 ms. (steps per millisecond=790 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:51:48] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 02:51:48] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:51:48] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 02:51:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:51:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:51:48] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-21 02:51:48] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 02:51:48] [INFO ] Added : 8 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 18 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 18 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 13 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 12 transition count 9
Applied a total of 18 rules in 6 ms. Remains 12 /21 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 02:51:48] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:51:48] [INFO ] Implicit Places using invariants in 22 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 23 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/21 places, 9/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30 ms. Remains : 11/21 places, 9/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Finished random walk after 4001 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1333 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
// Phase 1: matrix 9 rows 11 cols
[2024-05-21 02:51:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:51:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:51:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-21 02:51:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:51:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:51:49] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 02:51:49] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 02:51:49] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 96 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-01 finished in 2271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 02:51:49] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 02:51:49] [INFO ] Implicit Places using invariants in 39 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 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 43 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-02 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 p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 1}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 2}]], initial=4, aps=[p1:(GT s1 s12), p0:(GT s1 s6)], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-02 finished in 334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X(p1)&&(p2||G(p0))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 02:51:49] [INFO ] Invariant cache hit.
[2024-05-21 02:51:49] [INFO ] Implicit Places using invariants in 29 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 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 33 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 s17), p2:(GT 3 s8), p1:(LEQ 2 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 552 reset in 146 ms.
Stack based approach found an accepted trace after 44646 steps with 269 reset with depth 323 and stack size 323 in 71 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-03 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 02:51:50] [INFO ] Invariant cache hit.
[2024-05-21 02:51:50] [INFO ] Implicit Places using invariants in 33 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s9)], 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 92 ms.
Product exploration explored 100000 steps with 50000 reset in 69 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 (Minato strategy)
Knowledge based reduction with 3 factoid took 20 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-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-05 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&G((p1||X(p1))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2024-05-21 02:51:50] [INFO ] Invariant cache hit.
[2024-05-21 02:51:50] [INFO ] Implicit Places using invariants in 27 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/22 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 31 ms. Remains : 20/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 3 s1), p1:(GT s5 s14)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 157 ms.
Product exploration explored 100000 steps with 0 reset in 160 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 4) seen :3
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
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 20 cols
[2024-05-21 02:51:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:51:51] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:51:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:51] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:51:51] [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 3 ms.
[2024-05-21 02:51:51] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 27727 steps, including 0 resets, run visited all 1 properties in 39 ms. (steps per millisecond=710 )
Parikh walk visited 1 properties in 40 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 191 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 5 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
[2024-05-21 02:51:52] [INFO ] Invariant cache hit.
[2024-05-21 02:51:52] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 02:51:52] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-21 02:51:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 02:51:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-21 02:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 02:51:52] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-21 02:51:52] [INFO ] Computed and/alt/rep : 17/17/17 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 02:51:52] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-21 02:51:52] [INFO ] Invariant cache hit.
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-06 finished in 1938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 18 transition count 12
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 13 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 13 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 21 place count 11 transition count 8
Applied a total of 21 rules in 6 ms. Remains 11 /22 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 02:51:52] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:51:52] [INFO ] Implicit Places using invariants in 30 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 8/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 6
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-21 02:51:52] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 02:51:52] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 02:51:52] [INFO ] Invariant cache hit.
[2024-05-21 02:51:52] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/22 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 86 ms. Remains : 7/22 places, 6/18 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (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 p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s0), p1:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-07 finished in 288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||X(G(p1)))))||G(p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2024-05-21 02:51:52] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:51:52] [INFO ] Implicit Places using invariants in 26 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 29 ms. Remains : 21/22 places, 18/18 transitions.
Stuttering acceptance computed with spot in 231 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 137 ms.
Product exploration explored 100000 steps with 0 reset in 202 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 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X p0), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 153 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 220 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 7 ms. (steps per millisecond=2285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 18 rows 21 cols
[2024-05-21 02:51:54] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 02:51:54] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 02:51:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:51:54] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-21 02:51:54] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 2 ms to minimize.
[2024-05-21 02:51:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-21 02:51:54] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-21 02:51:54] [INFO ] After 130ms 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 6363 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 2 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 2 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 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) 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
Interrupted probabilistic random walk after 895010 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :{}
Probabilistic random walk after 895010 steps, saw 464420 distinct states, run finished after 3003 ms. (steps per millisecond=298 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 02:52:03] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:52:03] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 02:52:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2024-05-21 02:52:03] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 02:52:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-21 02:52:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-05-21 02:52:03] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-21 02:52:03] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 530 ms.
Support contains 3 out of 11 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 11/11 places, 8/8 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 7
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 10/11 places, 7/8 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3415311 steps, run timeout after 3001 ms. (steps per millisecond=1138 ) properties seen :{}
Probabilistic random walk after 3415311 steps, saw 1617380 distinct states, run finished after 3002 ms. (steps per millisecond=1137 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 02:52:07] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:52:07] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:52:07] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:52:07] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:52:07] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-21 02:52:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-21 02:52:07] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-21 02:52:07] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 92 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 0 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.
[2024-05-21 02:52:07] [INFO ] Invariant cache hit.
[2024-05-21 02:52:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 02:52:07] [INFO ] Invariant cache hit.
[2024-05-21 02:52:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 02:52:07] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:52:07] [INFO ] Invariant cache hit.
[2024-05-21 02:52:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 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
[2024-05-21 02:52:07] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:52:07] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:52:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:52:07] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:52:07] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-21 02:52:07] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X p0), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (NOT (AND p2 p1))), (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 621 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 240 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 222 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
[2024-05-21 02:52:08] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 02:52:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-21 02:52:08] [INFO ] Invariant cache hit.
[2024-05-21 02:52:08] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-21 02:52:08] [INFO ] Invariant cache hit.
[2024-05-21 02:52:08] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 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 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 122 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 253 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 6 ms. (steps per millisecond=2666 ) properties (out of 8) 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 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 02:52:09] [INFO ] Invariant cache hit.
[2024-05-21 02:52:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 02:52:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:52:09] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 02:52:09] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-21 02:52:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2024-05-21 02:52:09] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-21 02:52:09] [INFO ] After 111ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 4112 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 2 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 2 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 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3647550 steps, run timeout after 3020 ms. (steps per millisecond=1207 ) properties seen :{}
Probabilistic random walk after 3647550 steps, saw 1717920 distinct states, run finished after 3020 ms. (steps per millisecond=1207 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 02:52:16] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:52:16] [INFO ] After 14ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:52:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:52:16] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:52:16] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 02:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-05-21 02:52:16] [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.
[2024-05-21 02:52:16] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 94 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.
[2024-05-21 02:52:16] [INFO ] Invariant cache hit.
[2024-05-21 02:52:16] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 02:52:16] [INFO ] Invariant cache hit.
[2024-05-21 02:52:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 02:52:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:52:16] [INFO ] Invariant cache hit.
[2024-05-21 02:52:16] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 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
[2024-05-21 02:52:16] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:52:16] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:52:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:52:17] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:52:17] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-21 02:52:17] [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 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND 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 p2 p1))), (F (NOT p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 13 factoid took 411 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 253 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 253 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 245 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 137 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 285 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 4 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
[2024-05-21 02:52:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 14 rows 17 cols
[2024-05-21 02:52:18] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:52:18] [INFO ] Dead Transitions using invariants and state equation in 31 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.
Built C files in :
/tmp/ltsmin8880590222091947873
[2024-05-21 02:52:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8880590222091947873
Running compilation step : cd /tmp/ltsmin8880590222091947873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin8880590222091947873;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8880590222091947873;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2984730994565235156.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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
[2024-05-21 02:52:34] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:52:34] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 02:52:34] [INFO ] Invariant cache hit.
[2024-05-21 02:52:34] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-21 02:52:34] [INFO ] Invariant cache hit.
[2024-05-21 02:52:34] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 21/21 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin5804490855123056033
[2024-05-21 02:52:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5804490855123056033
Running compilation step : cd /tmp/ltsmin5804490855123056033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 88 ms.
Running link step : cd /tmp/ltsmin5804490855123056033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5804490855123056033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6631997256963102047.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 02:52:49] [INFO ] Flatten gal took : 5 ms
[2024-05-21 02:52:49] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:52:49] [INFO ] Time to serialize gal into /tmp/LTL6495852877692287438.gal : 6 ms
[2024-05-21 02:52:49] [INFO ] Time to serialize properties into /tmp/LTL7617851373914989342.prop : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6495852877692287438.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4335175260375987847.hoa' '-atoms' '/tmp/LTL7617851373914989342.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7617851373914989342.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4335175260375987847.hoa
Detected timeout of ITS tools.
[2024-05-21 02:53:04] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:53:04] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:53:04] [INFO ] Time to serialize gal into /tmp/LTL1337306969492269820.gal : 0 ms
[2024-05-21 02:53:04] [INFO ] Time to serialize properties into /tmp/LTL13847957691265549504.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1337306969492269820.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13847957691265549504.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
Detected timeout of ITS tools.
[2024-05-21 02:53:19] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:53:19] [INFO ] Applying decomposition
[2024-05-21 02:53:19] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13333302726615930645.txt' '-o' '/tmp/graph13333302726615930645.bin' '-w' '/tmp/graph13333302726615930645.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13333302726615930645.bin' '-l' '-1' '-v' '-w' '/tmp/graph13333302726615930645.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:53:19] [INFO ] Decomposing Gal with order
[2024-05-21 02:53:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:53:19] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 02:53:19] [INFO ] Flatten gal took : 24 ms
[2024-05-21 02:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-21 02:53:19] [INFO ] Time to serialize gal into /tmp/LTL17450310165969107355.gal : 1 ms
[2024-05-21 02:53:19] [INFO ] Time to serialize properties into /tmp/LTL17885239556830861637.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17450310165969107355.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17885239556830861637.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(gu0.SA<=gu0.Ci)")||(X(G("((gi1.gu2.CwG>=1)||(gu0.SA<=gu0.Ci))"))))))||(G("(gi1.gi0.gu6.MwU<3)"))))
Formula 0 simplified : XF(!"(gu0.SA<=gu0.Ci)" & XF!"((gi1.gu2.CwG>=1)||(gu0.SA<=gu0.Ci))") & F!"(gi1.gi0.gu6.MwU<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10151318470436487547
[2024-05-21 02:53:34] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10151318470436487547
Running compilation step : cd /tmp/ltsmin10151318470436487547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 90 ms.
Running link step : cd /tmp/ltsmin10151318470436487547;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10151318470436487547;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-09 finished in 116967 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U p1))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 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 16 place count 14 transition count 10
Applied a total of 16 rules in 6 ms. Remains 14 /22 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 02:53:49] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:53:49] [INFO ] Implicit Places using invariants in 65 ms returned [10, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 10/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 12 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 10 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 10 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 9 transition count 7
Applied a total of 6 rules in 6 ms. Remains 9 /12 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-21 02:53:49] [INFO ] Computed 3 invariants in 1 ms
[2024-05-21 02:53:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 02:53:49] [INFO ] Invariant cache hit.
[2024-05-21 02:53:49] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/22 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 9/22 places, 7/18 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s3), p0:(LEQ s7 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10289 reset in 70 ms.
Product exploration explored 100000 steps with 10273 reset in 76 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 6 ms. (steps per millisecond=2666 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-21 02:53:50] [INFO ] Invariant cache hit.
[2024-05-21 02:53:50] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:53:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-21 02:53:50] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:53:50] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-21 02:53:50] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 32001 steps, including 0 resets, run visited all 1 properties in 25 ms. (steps per millisecond=1280 )
Parikh walk visited 1 properties in 24 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p1)]
[2024-05-21 02:53:50] [INFO ] Invariant cache hit.
[2024-05-21 02:53:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND p0 (NOT p1)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 6 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-10 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U p1)))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/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 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 19 transition count 15
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 19 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 16 transition count 12
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 14 transition count 10
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 13 transition count 9
Applied a total of 18 rules in 3517 ms. Remains 13 /22 variables (removed 9) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2024-05-21 02:53:54] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:53:54] [INFO ] Implicit Places using invariants in 27 ms returned [6, 10, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 28 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/22 places, 9/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3548 ms. Remains : 10/22 places, 9/18 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LEQ s6 s9) (GT 2 s8)), p0:(LEQ s0 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 91 ms.
Product exploration explored 100000 steps with 0 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=3001 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1630200 steps, run timeout after 3001 ms. (steps per millisecond=543 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 1630200 steps, saw 997987 distinct states, run finished after 3001 ms. (steps per millisecond=543 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 9 rows 10 cols
[2024-05-21 02:53:58] [INFO ] Computed 2 invariants in 4 ms
[2024-05-21 02:53:58] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:53:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 02:53:58] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:53:58] [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.
[2024-05-21 02:53:58] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20032 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=1178 )
Parikh walk visited 1 properties in 18 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p0), (NOT p1)]
Support contains 5 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 02:53:58] [INFO ] Invariant cache hit.
[2024-05-21 02:53:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-21 02:53:58] [INFO ] Invariant cache hit.
[2024-05-21 02:53:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-21 02:53:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:53:58] [INFO ] Invariant cache hit.
[2024-05-21 02:53:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 87 ms. Remains : 10/10 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 (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p0), (NOT p1)]
Incomplete random walk after 12005 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2401 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 2576803 steps, run timeout after 3001 ms. (steps per millisecond=858 ) properties seen :{1=1, 2=1}
Probabilistic random walk after 2576803 steps, saw 1532516 distinct states, run finished after 3003 ms. (steps per millisecond=858 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-21 02:54:01] [INFO ] Invariant cache hit.
[2024-05-21 02:54:01] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:54:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-21 02:54:02] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:54:02] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-21 02:54:02] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 19435 steps, including 0 resets, run visited all 1 properties in 18 ms. (steps per millisecond=1079 )
Parikh walk visited 1 properties in 17 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 89 ms.
Product exploration explored 100000 steps with 0 reset in 111 ms.
Built C files in :
/tmp/ltsmin15537551669501011121
[2024-05-21 02:54:02] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-21 02:54:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:54:02] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-21 02:54:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:54:02] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-21 02:54:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:54:02] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15537551669501011121
Running compilation step : cd /tmp/ltsmin15537551669501011121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 72 ms.
Running link step : cd /tmp/ltsmin15537551669501011121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15537551669501011121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4420715775742854639.hoa' '--buchi-type=spotba'
LTSmin run took 1899 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-11 finished in 13992 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 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 9 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 10 place count 17 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 17 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 16 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 15 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 21 place count 11 transition count 8
Applied a total of 21 rules in 8 ms. Remains 11 /22 variables (removed 11) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 02:54:04] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:54:04] [INFO ] Implicit Places using invariants in 35 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 8/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
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 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
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 6 transition count 5
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2024-05-21 02:54:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-21 02:54:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-21 02:54:04] [INFO ] Invariant cache hit.
[2024-05-21 02:54:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/22 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 6/22 places, 5/18 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N2000P0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 56 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 0 ms.
FORMULA ClientsAndServers-PT-N2000P0-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-15 finished in 209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 239 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 22 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
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 4 rules applied. Total rules applied 4 place count 22 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 11 place count 18 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 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 16 place count 14 transition count 10
Applied a total of 16 rules in 6 ms. Remains 14 /22 variables (removed 8) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2024-05-21 02:54:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 02:54:05] [INFO ] Implicit Places using invariants in 23 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 13/22 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 1 ms. Remains 12 /13 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 02:54:05] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:54:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-21 02:54:05] [INFO ] Invariant cache hit.
[2024-05-21 02:54:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 12/22 places, 9/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 74 ms. Remains : 12/22 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 143 ms.
Product exploration explored 100000 steps with 0 reset in 113 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 (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X p0), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 168 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 238 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 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-21 02:54:06] [INFO ] Invariant cache hit.
[2024-05-21 02:54:06] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-21 02:54:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:54:06] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-21 02:54:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 02:54:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-21 02:54:06] [INFO ] After 44ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 02:54:06] [INFO ] After 77ms 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 3430 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 2 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 2 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 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 958686 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :{}
Probabilistic random walk after 958686 steps, saw 488170 distinct states, run finished after 3001 ms. (steps per millisecond=319 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 02:54:12] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:54:12] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 02:54:13] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:54:13] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 02:54:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-21 02:54:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-21 02:54:13] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-21 02:54:13] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 103954 steps, including 0 resets, run visited all 2 properties in 537 ms. (steps per millisecond=193 )
Parikh walk visited 2 properties in 537 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X p0), (X (X (NOT (AND (NOT p2) p0)))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p0))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1))), (F (AND (NOT p2) p1)), (F (NOT p0)), (F (NOT (AND p2 p1))), (F (NOT p1)), (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 684 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 258 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 236 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 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 02:54:14] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:54:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-21 02:54:14] [INFO ] Invariant cache hit.
[2024-05-21 02:54:14] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-21 02:54:14] [INFO ] Invariant cache hit.
[2024-05-21 02:54:14] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 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 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 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 224 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 6 ms. (steps per millisecond=2666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-21 02:54:15] [INFO ] Invariant cache hit.
[2024-05-21 02:54:15] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-21 02:54:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:54:15] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-21 02:54:15] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 02:54:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2024-05-21 02:54:15] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-21 02:54:15] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 2649 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 1 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 1 ms. Remains : 10/12 places, 7/9 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=8000 ) 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 3550227 steps, run timeout after 3001 ms. (steps per millisecond=1183 ) properties seen :{}
Probabilistic random walk after 3550227 steps, saw 1674840 distinct states, run finished after 3001 ms. (steps per millisecond=1183 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 7 rows 10 cols
[2024-05-21 02:54:21] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 02:54:21] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:54:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-21 02:54:21] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:54:21] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-21 02:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-21 02:54:21] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-21 02:54:21] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 105 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 1 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.
[2024-05-21 02:54:21] [INFO ] Invariant cache hit.
[2024-05-21 02:54:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 02:54:21] [INFO ] Invariant cache hit.
[2024-05-21 02:54:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-21 02:54:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 02:54:21] [INFO ] Invariant cache hit.
[2024-05-21 02:54:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 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 3 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
[2024-05-21 02:54:21] [INFO ] Computed 3 invariants in 0 ms
[2024-05-21 02:54:21] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 02:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 02:54:21] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 02:54:21] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-21 02:54:21] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2)), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND 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 p2 p1))), (F (NOT p2)), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 13 factoid took 422 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 245 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 223 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 236 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 146 ms.
Product exploration explored 100000 steps with 0 reset in 123 ms.
Applying partial POR strategy [true, false, true, true, false, false, false]
Stuttering acceptance computed with spot in 210 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 0 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 02:54:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2024-05-21 02:54:23] [INFO ] Computed 4 invariants in 0 ms
[2024-05-21 02:54:23] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46 ms. Remains : 12/12 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin15374003803243118896
[2024-05-21 02:54:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15374003803243118896
Running compilation step : cd /tmp/ltsmin15374003803243118896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 81 ms.
Running link step : cd /tmp/ltsmin15374003803243118896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin15374003803243118896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16245959546054683840.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 2 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2024-05-21 02:54:38] [INFO ] Invariant cache hit.
[2024-05-21 02:54:38] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-21 02:54:38] [INFO ] Invariant cache hit.
[2024-05-21 02:54:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-21 02:54:38] [INFO ] Invariant cache hit.
[2024-05-21 02:54:38] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 12/12 places, 9/9 transitions.
Built C files in :
/tmp/ltsmin5105941138020725697
[2024-05-21 02:54:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5105941138020725697
Running compilation step : cd /tmp/ltsmin5105941138020725697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 86 ms.
Running link step : cd /tmp/ltsmin5105941138020725697;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5105941138020725697;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7470037345894325474.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-21 02:54:53] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:54:53] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:54:53] [INFO ] Time to serialize gal into /tmp/LTL1323171696815600449.gal : 2 ms
[2024-05-21 02:54:53] [INFO ] Time to serialize properties into /tmp/LTL6268060176003518459.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1323171696815600449.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16635567554213523694.hoa' '-atoms' '/tmp/LTL6268060176003518459.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6268060176003518459.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16635567554213523694.hoa
Detected timeout of ITS tools.
[2024-05-21 02:55:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:55:08] [INFO ] Flatten gal took : 1 ms
[2024-05-21 02:55:08] [INFO ] Time to serialize gal into /tmp/LTL14375042130862389508.gal : 1 ms
[2024-05-21 02:55:08] [INFO ] Time to serialize properties into /tmp/LTL522715760262404950.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14375042130862389508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL522715760262404950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
Detected timeout of ITS tools.
[2024-05-21 02:55:23] [INFO ] Flatten gal took : 4 ms
[2024-05-21 02:55:23] [INFO ] Applying decomposition
[2024-05-21 02:55:23] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7661610023480520684.txt' '-o' '/tmp/graph7661610023480520684.bin' '-w' '/tmp/graph7661610023480520684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7661610023480520684.bin' '-l' '-1' '-v' '-w' '/tmp/graph7661610023480520684.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:55:23] [INFO ] Decomposing Gal with order
[2024-05-21 02:55:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:55:23] [INFO ] Flatten gal took : 2 ms
[2024-05-21 02:55:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 02:55:23] [INFO ] Time to serialize gal into /tmp/LTL14864664097378602633.gal : 0 ms
[2024-05-21 02:55:23] [INFO ] Time to serialize properties into /tmp/LTL7401488018421674022.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14864664097378602633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7401488018421674022.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(gu2.SA<=gu2.Ci)")||(X(G("((gi0.gu1.CwG>=1)||(gu2.SA<=gu2.Ci))"))))))||(G("(gi0.gu0.MwU<3)"))))
Formula 0 simplified : XF(!"(gu2.SA<=gu2.Ci)" & XF!"((gi0.gu1.CwG>=1)||(gu2.SA<=gu2.Ci))") & F!"(gi0.gu0.MwU<3)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14730511488026231552
[2024-05-21 02:55:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14730511488026231552
Running compilation step : cd /tmp/ltsmin14730511488026231552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 80 ms.
Running link step : cd /tmp/ltsmin14730511488026231552;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14730511488026231552;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N2000P0-LTLCardinality-09 finished in 108824 ms.
[2024-05-21 02:55:53] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10272711598082612218
[2024-05-21 02:55:53] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-21 02:55:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:55:53] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-21 02:55:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:55:53] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-21 02:55:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 02:55:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10272711598082612218
Running compilation step : cd /tmp/ltsmin10272711598082612218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-21 02:55:53] [INFO ] Applying decomposition
[2024-05-21 02:55:53] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3638309878228786020.txt' '-o' '/tmp/graph3638309878228786020.bin' '-w' '/tmp/graph3638309878228786020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3638309878228786020.bin' '-l' '-1' '-v' '-w' '/tmp/graph3638309878228786020.weights' '-q' '0' '-e' '0.001'
[2024-05-21 02:55:53] [INFO ] Decomposing Gal with order
[2024-05-21 02:55:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 02:55:53] [INFO ] Removed a total of 1 redundant transitions.
[2024-05-21 02:55:53] [INFO ] Flatten gal took : 3 ms
[2024-05-21 02:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-21 02:55:53] [INFO ] Time to serialize gal into /tmp/LTLCardinality16161245520534545046.gal : 1 ms
[2024-05-21 02:55:53] [INFO ] Time to serialize properties into /tmp/LTLCardinality14696201690178953096.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16161245520534545046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14696201690178953096.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(gu7.SA<=gu7.Ci)")||(X(G("((gi0.gi2.gu6.CwG>=1)||(gu7.SA<=gu7.Ci))"))))))||(G("(gi0.gi1.gu2.MwU<3)"))))
Formula 0 simplified : XF(!"(gu7.SA<=gu7.Ci)" & XF!"((gi0.gi2.gu6.CwG>=1)||(gu7.SA<=gu7.Ci))") & F!"(gi0.gi1.gu2.MwU<3)"
Compilation finished in 113 ms.
Running link step : cd /tmp/ltsmin10272711598082612218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin10272711598082612218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: (X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))
pins2lts-mc-linux64( 1/ 8), 0.002: "(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.054: DFS-FIFO for weak LTL, using special progress label 22
pins2lts-mc-linux64( 0/ 8), 0.054: There are 23 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.054: State length is 23, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.054: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.054: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.054: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.054: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.067: ~1 levels ~960 states ~2872 transitions
pins2lts-mc-linux64( 0/ 8), 0.073: ~1 levels ~1920 states ~6200 transitions
pins2lts-mc-linux64( 0/ 8), 0.128: ~1 levels ~3840 states ~13224 transitions
pins2lts-mc-linux64( 0/ 8), 0.191: ~1 levels ~7680 states ~28072 transitions
pins2lts-mc-linux64( 0/ 8), 0.288: ~1 levels ~15360 states ~59160 transitions
pins2lts-mc-linux64( 3/ 8), 0.443: ~1 levels ~30720 states ~147816 transitions
pins2lts-mc-linux64( 3/ 8), 0.687: ~1 levels ~61440 states ~309816 transitions
pins2lts-mc-linux64( 6/ 8), 1.085: ~1 levels ~122880 states ~613368 transitions
pins2lts-mc-linux64( 4/ 8), 1.637: ~1 levels ~245760 states ~1344768 transitions
pins2lts-mc-linux64( 4/ 8), 2.293: ~1 levels ~491520 states ~2809504 transitions
pins2lts-mc-linux64( 4/ 8), 3.175: ~1 levels ~983040 states ~5822712 transitions
pins2lts-mc-linux64( 4/ 8), 4.658: ~1 levels ~1966080 states ~12106072 transitions
pins2lts-mc-linux64( 6/ 8), 7.630: ~1 levels ~3932160 states ~24128080 transitions
pins2lts-mc-linux64( 6/ 8), 13.942: ~1 levels ~7864320 states ~49987168 transitions
pins2lts-mc-linux64( 6/ 8), 27.195: ~1 levels ~15728640 states ~103240216 transitions
pins2lts-mc-linux64( 6/ 8), 56.997: ~1 levels ~31457280 states ~214690232 transitions
pins2lts-mc-linux64( 3/ 8), 107.143: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 107.219:
pins2lts-mc-linux64( 0/ 8), 107.219: mean standard work distribution: 2.8% (states) 3.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 107.219:
pins2lts-mc-linux64( 0/ 8), 107.219: Explored 52500216 states 383908971 transitions, fanout: 7.313
pins2lts-mc-linux64( 0/ 8), 107.219: Total exploration time 107.120 sec (107.080 sec minimum, 107.099 sec on average)
pins2lts-mc-linux64( 0/ 8), 107.219: States per second: 490107, Transitions per second: 3583915
pins2lts-mc-linux64( 0/ 8), 107.219:
pins2lts-mc-linux64( 0/ 8), 107.219: Progress states detected: 60257064
pins2lts-mc-linux64( 0/ 8), 107.219: Redundant explorations: -12.8731
pins2lts-mc-linux64( 0/ 8), 107.219:
pins2lts-mc-linux64( 0/ 8), 107.219: Queue width: 8B, total height: 16973667, memory: 129.50MB
pins2lts-mc-linux64( 0/ 8), 107.219: Tree memory: 715.7MB, 12.5 B/state, compr.: 13.2%
pins2lts-mc-linux64( 0/ 8), 107.219: Tree fill ratio (roots/leafs): 44.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 107.219: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 107.219: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 107.219: Est. total memory use: 845.2MB (~1153.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10272711598082612218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10272711598082612218;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X([](((LTLAPp0==true)||X([]((LTLAPp1==true))))))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-21 03:17:21] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:17:21] [INFO ] Time to serialize gal into /tmp/LTLCardinality855162924753139433.gal : 1 ms
[2024-05-21 03:17:21] [INFO ] Time to serialize properties into /tmp/LTLCardinality4905410563233299292.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality855162924753139433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4905410563233299292.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
Detected timeout of ITS tools.
[2024-05-21 03:38:48] [INFO ] Flatten gal took : 2 ms
[2024-05-21 03:38:48] [INFO ] Input system was already deterministic with 18 transitions.
[2024-05-21 03:38:48] [INFO ] Transformed 22 places.
[2024-05-21 03:38:48] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 03:38:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality17901837766745887765.gal : 1 ms
[2024-05-21 03:38:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality14911729744719466741.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17901837766745887765.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14911729744719466741.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X(G(("(SA<=Ci)")||(X(G("((CwG>=1)||(SA<=Ci))"))))))||(G("(MwU<3)"))))
Formula 0 simplified : XF(!"(SA<=Ci)" & XF!"((CwG>=1)||(SA<=Ci))") & F!"(MwU<3)"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11108316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16040052 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r087-tall-171620522000327"
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 ;