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-162038291600205.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-N0020P4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r045-oct2-162038291600205
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.7K Mar 28 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 28 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 03:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:33 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-N0020P4-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-15

=== Now, execution of the tool begins

BK_START 1620567212280

Running Version 0
[2021-05-09 13:33:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 13:33:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 13:33:35] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-09 13:33:35] [INFO ] Transformed 25 places.
[2021-05-09 13:33:35] [INFO ] Transformed 18 transitions.
[2021-05-09 13:33:35] [INFO ] Parsed PT model containing 25 places and 18 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 13:33:35] [INFO ] Initial state test concluded for 2 properties.
FORMULA ClientsAndServers-PT-N0020P4-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 30 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 13:33:35] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-09 13:33:35] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:33:35] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-09 13:33:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:33:35] [INFO ] Computed 7 place invariants in 6 ms
[2021-05-09 13:33:35] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 13:33:35] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 13:33:35] [INFO ] Flatten gal took : 31 ms
FORMULA ClientsAndServers-PT-N0020P4-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 13:33:35] [INFO ] Flatten gal took : 3 ms
[2021-05-09 13:33:35] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 100024 steps, including 28 resets, run finished after 114 ms. (steps per millisecond=877 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 13:33:36] [INFO ] Computed 7 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(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 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 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 2 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 2 with 6 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 14 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 13:33:36] [INFO ] Computed 4 place invariants in 4 ms
[2021-05-09 13:33:36] [INFO ] Implicit Places using invariants in 35 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
[2021-05-09 13:33:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 13:33:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:33:36] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Starting structural reductions, iteration 1 : 9/24 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
[2021-05-09 13:33:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:33:36] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:33:36] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:33:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 7/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-00 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:(AND (GEQ s3 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6966 reset in 239 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-00 finished in 717 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(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
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 13:33:36] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 13:33:36] [INFO ] Implicit Places using invariants in 19 ms returned [14]
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 13:33:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:36] [INFO ] Dead Transitions using invariants and state equation in 33 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 13:33:36] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-01 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p0:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-01 finished in 238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(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
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 0 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 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-02 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s3 1) (GEQ s14 1)), p1:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-02 finished in 247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0 U 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 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 13:33:37] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:33:37] [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.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 38 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 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (GEQ s11 1) (GEQ s16 1)), p0:(GEQ s9 1)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-04 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(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 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 1 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 13:33:37] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-06 automaton TGBA [mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(LT s12 1), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-06 finished in 259 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G((p1&&F(p2))))))], 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 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 1 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 13:33:37] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:37] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:37] [INFO ] Dead Transitions using invariants and state equation in 26 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 13:33:37] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LT s18 1), p0:(AND (GEQ s5 1) (GEQ s14 1)), p2:(AND (GEQ s8 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 1 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-07 finished in 285 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((!p0 U (G(!p0)||(X(X(X(!p0)))&&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 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 1 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 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 13:33:38] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 499 ms :[p0, p0, p0, p0, p0, true, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-08 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(AND p1 p0), acceptance={} source=0 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 7}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 10}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 11}, { cond=(AND p1 p0), acceptance={} source=4 dest: 12}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 13}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={} source=7 dest: 14}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 15}], [{ cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={} source=9 dest: 10}, { cond=(AND p1 p0), acceptance={} source=9 dest: 12}], [{ cond=p0, acceptance={} source=10 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=11 dest: 5}, { cond=(AND p1 p0), acceptance={} source=11 dest: 6}], [{ cond=p0, acceptance={} source=12 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=13 dest: 3}, { cond=(AND p1 p0), acceptance={} source=13 dest: 14}], [{ cond=true, acceptance={} source=14 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=15 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=15 dest: 9}, { cond=(AND p1 p0), acceptance={} source=15 dest: 16}, { cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 17}], [{ cond=p0, acceptance={} source=16 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=17 dest: 8}, { cond=(AND p1 p0), acceptance={} source=17 dest: 16}]], initial=2, aps=[p1:(AND (GEQ s8 1) (GEQ s15 1) (OR (LT s2 1) (LT s14 1))), p0:(AND (GEQ s2 1) (GEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 623 steps with 85 reset in 21 ms.
FORMULA ClientsAndServers-PT-N0020P4-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-08 finished in 650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(p1))))], 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
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 1 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 13:33:38] [INFO ] Computed 4 place invariants in 13 ms
[2021-05-09 13:33:38] [INFO ] Implicit Places using invariants in 45 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 13:33:38] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 21 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 13:33:38] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:33:38] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s10 1), p1:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 65 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 121 ms.
[2021-05-09 13:33:39] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:33:39] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:33:39] [INFO ] Time to serialize gal into /tmp/LTL14927682561067891123.gal : 1 ms
[2021-05-09 13:33:39] [INFO ] Time to serialize properties into /tmp/LTL10893787649276874800.ltl : 1 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/LTL14927682561067891123.gal, -t, CGAL, -LTL, /tmp/LTL10893787649276874800.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/LTL14927682561067891123.gal -t CGAL -LTL /tmp/LTL10893787649276874800.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(MtF<1)")&&(X("(StF<1)")))))
Formula 0 simplified : !F("(MtF<1)" & X"(StF<1)")
Detected timeout of ITS tools.
[2021-05-09 13:33:54] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:33:54] [INFO ] Applying decomposition
[2021-05-09 13:33:54] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5762294568903176403.txt, -o, /tmp/graph5762294568903176403.bin, -w, /tmp/graph5762294568903176403.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5762294568903176403.bin, -l, -1, -v, -w, /tmp/graph5762294568903176403.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:33:54] [INFO ] Decomposing Gal with order
[2021-05-09 13:33:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:33:54] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 13:33:55] [INFO ] Flatten gal took : 174 ms
[2021-05-09 13:33:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2021-05-09 13:33:55] [INFO ] Time to serialize gal into /tmp/LTL1881233323481087648.gal : 1 ms
[2021-05-09 13:33:55] [INFO ] Time to serialize properties into /tmp/LTL14187329387504894297.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/LTL1881233323481087648.gal, -t, CGAL, -LTL, /tmp/LTL14187329387504894297.ltl, -c, -stutter-deadlock], 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/LTL1881233323481087648.gal -t CGAL -LTL /tmp/LTL14187329387504894297.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F(("(u0.MtF<1)")&&(X("(u0.StF<1)")))))
Formula 0 simplified : !F("(u0.MtF<1)" & X"(u0.StF<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5529502411461312753
[2021-05-09 13:34:10] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5529502411461312753
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin5529502411461312753]
Compilation finished in 214 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5529502411461312753]
Link finished in 44 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>(((LTLAPp0==true)&&X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin5529502411461312753]
LTSmin run took 485 ms.
FORMULA ClientsAndServers-PT-N0020P4-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-09 finished in 32158 ms.
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 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 17 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 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 14 place count 16 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 18 place count 14 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 8
Applied a total of 22 rules in 2 ms. Remains 12 /24 variables (removed 12) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2021-05-09 13:34:10] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 13:34:10] [INFO ] Implicit Places using invariants in 19 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 ms to find 2 implicit places.
[2021-05-09 13:34:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 13:34:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Dead Transitions using invariants and state equation in 28 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 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 6 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:34:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 13:34:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 8/24 places, 6/18 transitions.
Stuttering acceptance computed with spot in 25 ms :[true, (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-10 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:(OR (LT s1 1) (LT s7 1))], 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 14 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-10 finished in 146 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(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.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 27 place count 9 transition count 6
Applied a total of 27 rules in 2 ms. Remains 9 /24 variables (removed 15) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2021-05-09 13:34:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants in 12 ms returned [6, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13 ms to find 2 implicit places.
[2021-05-09 13:34:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 13:34:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 7/24 places, 6/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 7 transition count 4
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 4
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 13:34:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 13:34:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/24 places, 4/18 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4 reset in 115 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-12 finished in 298 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.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 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 2 with 2 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 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 25 place count 10 transition count 7
Applied a total of 25 rules in 2 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 13:34:11] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants in 49 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
[2021-05-09 13:34:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 13:34:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Starting structural reductions, iteration 1 : 8/24 places, 7/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 0 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:34:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 13:34:11] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:11] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 84 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 133 ms :[p0, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13891 reset in 98 ms.
Product exploration explored 100000 steps with 13899 reset in 186 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 97 ms :[p0, p0]
Product exploration explored 100000 steps with 13849 reset in 70 ms.
Product exploration explored 100000 steps with 13920 reset in 167 ms.
[2021-05-09 13:34:12] [INFO ] Flatten gal took : 0 ms
[2021-05-09 13:34:12] [INFO ] Flatten gal took : 11 ms
[2021-05-09 13:34:12] [INFO ] Time to serialize gal into /tmp/LTL15532631343762961020.gal : 0 ms
[2021-05-09 13:34:12] [INFO ] Time to serialize properties into /tmp/LTL13081571274150736131.ltl : 3 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/LTL15532631343762961020.gal, -t, CGAL, -LTL, /tmp/LTL13081571274150736131.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/LTL15532631343762961020.gal -t CGAL -LTL /tmp/LTL13081571274150736131.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(Cb>=1)"))))
Formula 0 simplified : !GF"(Cb>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
375 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,3.79785,62124,1,0,1098,194506,24,759,658,197753,1909
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0020P4-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ClientsAndServers-PT-N0020P4-13 finished in 5128 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U (p1||F(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
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 4 rules applied. Total rules applied 4 place count 21 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 7 place count 20 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 15
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 9 place count 18 transition count 11
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 17 place count 14 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 19 place count 13 transition count 10
Applied a total of 19 rules in 1 ms. Remains 13 /24 variables (removed 11) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 13:34:16] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:34:16] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 13:34:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:34:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-09 13:34:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-09 13:34:16] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 13:34:16] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s11 1), p2:(AND (GEQ s3 1) (GEQ s9 1)), p0:(AND (GEQ s5 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 16167 reset in 103 ms.
Product exploration explored 100000 steps with 16221 reset in 128 ms.
Knowledge obtained : [(NOT p1), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 16131 reset in 67 ms.
Product exploration explored 100000 steps with 16099 reset in 118 ms.
[2021-05-09 13:34:17] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:34:17] [INFO ] Flatten gal took : 0 ms
[2021-05-09 13:34:17] [INFO ] Time to serialize gal into /tmp/LTL15006876362059997952.gal : 27 ms
[2021-05-09 13:34:17] [INFO ] Time to serialize properties into /tmp/LTL498308869772237039.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/LTL15006876362059997952.gal, -t, CGAL, -LTL, /tmp/LTL498308869772237039.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/LTL15006876362059997952.gal -t CGAL -LTL /tmp/LTL498308869772237039.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F(G("((CR>=1)&&(Si>=1))")))U(("(StR>=1)")||(F("((SR>=1)&&(Mi>=1))")))))
Formula 0 simplified : !(FG"((CR>=1)&&(Si>=1))" U ("(StR>=1)" | F"((SR>=1)&&(Mi>=1))"))
Detected timeout of ITS tools.
[2021-05-09 13:34:32] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:34:32] [INFO ] Applying decomposition
[2021-05-09 13:34:32] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph6488674967247473837.txt, -o, /tmp/graph6488674967247473837.bin, -w, /tmp/graph6488674967247473837.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph6488674967247473837.bin, -l, -1, -v, -w, /tmp/graph6488674967247473837.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 13:34:32] [INFO ] Decomposing Gal with order
[2021-05-09 13:34:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 13:34:32] [INFO ] Flatten gal took : 1 ms
[2021-05-09 13:34:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 13:34:32] [INFO ] Time to serialize gal into /tmp/LTL3097427104013764323.gal : 3 ms
[2021-05-09 13:34:32] [INFO ] Time to serialize properties into /tmp/LTL5781488279854802099.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/LTL3097427104013764323.gal, -t, CGAL, -LTL, /tmp/LTL5781488279854802099.ltl, -c, -stutter-deadlock], 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/LTL3097427104013764323.gal -t CGAL -LTL /tmp/LTL5781488279854802099.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F(G("((u3.CR>=1)&&(u1.Si>=1))")))U(("(u0.StR>=1)")||(F("((u0.SR>=1)&&(u2.Mi>=1))")))))
Formula 0 simplified : !(FG"((u3.CR>=1)&&(u1.Si>=1))" U ("(u0.StR>=1)" | F"((u0.SR>=1)&&(u2.Mi>=1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin421937462292339237
[2021-05-09 13:34:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin421937462292339237
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin421937462292339237]
Compilation finished in 134 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin421937462292339237]
Link finished in 47 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>([]((LTLAPp0==true))) U ((LTLAPp1==true)||<>((LTLAPp2==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin421937462292339237]
LTSmin run took 1000 ms.
FORMULA ClientsAndServers-PT-N0020P4-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-14 finished in 32539 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p0) U p1) U G((F(!p0)&&p2))))], 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 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 1 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 13:34:49] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 13:34:49] [INFO ] Implicit Places using invariants in 228 ms returned [7, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 253 ms to find 2 implicit places.
[2021-05-09 13:34:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 13:34:49] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 9/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 9 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 13:34:49] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:49] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 8 cols
[2021-05-09 13:34:49] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 13:34:49] [INFO ] Implicit Places using invariants and state equation in 20 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 : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p2) p0), (NOT p0), (NOT p1), p0, (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-15 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s5 1)), p0:(GEQ s7 1), p1:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6655 reset in 121 ms.
Stack based approach found an accepted trace after 22664 steps with 1527 reset with depth 71 and stack size 71 in 13 ms.
FORMULA ClientsAndServers-PT-N0020P4-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-15 finished in 763 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620567290430

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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-N0020P4"
export BK_EXAMINATION="LTLFireability"
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-N0020P4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r045-oct2-162038291600205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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