fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r045-oct2-162038291500124
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ClientsAndServers-PT-N0002P1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
302.123 5941.00 13824.00 47.80 FFFTTTTFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r045-oct2-162038291500124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ClientsAndServers-PT-N0002P1, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291500124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 12:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 8 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 9.2K May 5 16:51 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-N0002P1-00
FORMULA_NAME ClientsAndServers-PT-N0002P1-01
FORMULA_NAME ClientsAndServers-PT-N0002P1-02
FORMULA_NAME ClientsAndServers-PT-N0002P1-03
FORMULA_NAME ClientsAndServers-PT-N0002P1-04
FORMULA_NAME ClientsAndServers-PT-N0002P1-05
FORMULA_NAME ClientsAndServers-PT-N0002P1-06
FORMULA_NAME ClientsAndServers-PT-N0002P1-07
FORMULA_NAME ClientsAndServers-PT-N0002P1-08
FORMULA_NAME ClientsAndServers-PT-N0002P1-09
FORMULA_NAME ClientsAndServers-PT-N0002P1-10
FORMULA_NAME ClientsAndServers-PT-N0002P1-11
FORMULA_NAME ClientsAndServers-PT-N0002P1-12
FORMULA_NAME ClientsAndServers-PT-N0002P1-13
FORMULA_NAME ClientsAndServers-PT-N0002P1-14
FORMULA_NAME ClientsAndServers-PT-N0002P1-15

=== Now, execution of the tool begins

BK_START 1620562471446

Running Version 0
[2021-05-09 12:14:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 12:14:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:14:32] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-09 12:14:32] [INFO ] Transformed 25 places.
[2021-05-09 12:14:32] [INFO ] Transformed 18 transitions.
[2021-05-09 12:14:32] [INFO ] Parsed PT model containing 25 places and 18 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:14:32] [INFO ] Initial state test concluded for 7 properties.
FORMULA ClientsAndServers-PT-N0002P1-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 8 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:14:33] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-09 12:14:33] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:14:33] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 12:14:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:14:33] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 12:14:33] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 12:14:33] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 12:14:33] [INFO ] Flatten gal took : 16 ms
FORMULA ClientsAndServers-PT-N0002P1-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0002P1-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:14:33] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:14:33] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=847 ) properties (out of 21) seen :20
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:14:33] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-09 12:14:33] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-09 12:14:33] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA ClientsAndServers-PT-N0002P1-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 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 3 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 18 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2021-05-09 12:14:33] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:14:33] [INFO ] Implicit Places using invariants in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
[2021-05-09 12:14:33] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:14:33] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:14:33] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 10/24 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 10 transition count 7
Reduce places removed 2 places and 0 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 1 with 3 rules applied. Total rules applied 4 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 6 transition count 5
Applied a total of 7 rules in 2 ms. Remains 6 /10 variables (removed 4) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 12:14:33] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 12:14:33] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 12:14:33] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 12:14:33] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-00 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0||F(p1))&&(p0||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:14:33] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:14:33] [INFO ] Implicit Places using invariants in 19 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:33] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:33] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-02 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ 1 s17), p1:(GT s9 s15), p0:(LEQ s7 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-02 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 1 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:14:34] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:14:34] [INFO ] Implicit Places using invariants in 13 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 13 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:34] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:34] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:34] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:14:34] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT 2 s16), p1:(LEQ s3 s14)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 93 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Product exploration explored 100000 steps with 50000 reset in 82 ms.
Product exploration explored 100000 steps with 50000 reset in 77 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Support contains 3 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 19 transition count 16
Deduced a syphon composed of 7 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 19 transition count 16
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 13 rules in 7 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 12:14:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 12:14:35] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
[2021-05-09 12:14:35] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:14:35] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:14:35] [INFO ] Time to serialize gal into /tmp/LTL7384603168222050506.gal : 0 ms
[2021-05-09 12:14:35] [INFO ] Time to serialize properties into /tmp/LTL4297348222351259746.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL7384603168222050506.gal, -t, CGAL, -LTL, /tmp/LTL4297348222351259746.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7384603168222050506.gal -t CGAL -LTL /tmp/LTL4297348222351259746.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(SwG<2)"))&&(X("(CA<=Si)"))))
Formula 0 simplified : !(F"(SwG<2)" & X"(CA<=Si)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
21 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.233635,24316,1,0,6,44701,17,0,586,52396,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ClientsAndServers-PT-N0002P1-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ClientsAndServers-PT-N0002P1-05 finished in 1589 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(((p0||X(G(p0))) U p1))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 18
Applied a total of 2 rules in 0 ms. Remains 22 /24 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-09 12:14:35] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:14:35] [INFO ] Implicit Places using invariants in 19 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 20 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:14:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:35] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:14:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-07 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={1, 2} source=0 dest: 0}, { cond=p2, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={1, 2} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={2} source=2 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 2} source=2 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LEQ 3 s11) (LEQ 2 s20)), p1:(LEQ s19 s8), p0:(LEQ s3 s14)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 69 reset in 177 ms.
Stack based approach found an accepted trace after 723 steps with 0 reset with depth 724 and stack size 723 in 2 ms.
FORMULA ClientsAndServers-PT-N0002P1-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-07 finished in 393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (G(p0)||(p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 20 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 17 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 3 ms. Remains 14 /24 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 14 cols
[2021-05-09 12:14:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-09 12:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 12:14:36] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 12:14:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 13/24 places, 10/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 7 place count 9 transition count 7
Applied a total of 7 rules in 2 ms. Remains 9 /13 variables (removed 4) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:14:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:14:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(GT 2 s1), p1:(GT s6 s7)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 39 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-08 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U (F(!p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 17 transition count 13
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 2 ms. Remains 13 /24 variables (removed 11) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 13 cols
[2021-05-09 12:14:36] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants in 16 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
[2021-05-09 12:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 12:14:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:36] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 12/24 places, 9/18 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 12 transition count 8
Reduce places removed 2 places and 0 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 1 with 3 rules applied. Total rules applied 4 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 9 transition count 7
Applied a total of 5 rules in 0 ms. Remains 9 /12 variables (removed 3) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:14:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:14:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-10 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ s7 s0), p0:(LEQ s6 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-10 finished in 140 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 25 place count 10 transition count 7
Applied a total of 25 rules in 4 ms. Remains 10 /24 variables (removed 14) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2021-05-09 12:14:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2021-05-09 12:14:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-09 12:14:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 10 cols
[2021-05-09 12:14:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-11 automaton TGBA [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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 s1), p1:(LEQ s0 s5)], 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 386 reset in 97 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-11 finished in 252 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F((p0 U (p1||G(p0))))) U p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 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 21 transition count 18
Applied a total of 3 rules in 3 ms. Remains 21 /24 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:14:36] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:36] [INFO ] Implicit Places using invariants in 48 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:14:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:14:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 20/24 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:14:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:14:36] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(GT s9 s18), p1:(AND (GT 3 s3) (LEQ s7 s19)), p0:(LEQ s7 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 130 reset in 120 ms.
Stack based approach found an accepted trace after 666 steps with 0 reset with depth 667 and stack size 667 in 1 ms.
FORMULA ClientsAndServers-PT-N0002P1-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-13 finished in 364 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 24/24 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 16 place count 15 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 17 place count 14 transition count 9
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 12 transition count 9
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 29 place count 8 transition count 5
Applied a total of 29 rules in 2 ms. Remains 8 /24 variables (removed 16) and now considering 5/18 (removed 13) transitions.
// Phase 1: matrix 5 rows 8 cols
[2021-05-09 12:14:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:14:37] [INFO ] Implicit Places using invariants in 17 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 17 ms to find 1 implicit places.
[2021-05-09 12:14:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 12:14:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:14:37] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 7/24 places, 5/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2021-05-09 12:14:37] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-09 12:14:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:14:37] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 5/18 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0002P1-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8389 reset in 54 ms.
Stack based approach found an accepted trace after 65 steps with 6 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ClientsAndServers-PT-N0002P1-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0002P1-15 finished in 170 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620562477387

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-N0002P1"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0002P1, 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 r045-oct2-162038291500124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0002P1.tgz
mv ClientsAndServers-PT-N0002P1 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 ;