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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 125K 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.4K 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 17K Mar 28 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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-N0005P1-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-15

=== Now, execution of the tool begins

BK_START 1620562656259

Running Version 0
[2021-05-09 12:17:37] [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 12:17:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:17:37] [INFO ] Load time of PNML (sax parser for PT used): 16 ms
[2021-05-09 12:17:37] [INFO ] Transformed 25 places.
[2021-05-09 12:17:37] [INFO ] Transformed 18 transitions.
[2021-05-09 12:17:37] [INFO ] Parsed PT model containing 25 places and 18 transitions in 44 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ClientsAndServers-PT-N0005P1-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 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 24 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:17:37] [INFO ] Computed 7 place invariants in 5 ms
[2021-05-09 12:17:37] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:17:37] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-09 12:17:37] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 18 rows 24 cols
[2021-05-09 12:17:37] [INFO ] Computed 7 place invariants in 19 ms
[2021-05-09 12:17:37] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/25 places, 18/18 transitions.
[2021-05-09 12:17:38] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 12:17:38] [INFO ] Flatten gal took : 14 ms
FORMULA ClientsAndServers-PT-N0005P1-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:17:38] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:17:38] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 217 steps, including 0 resets, run visited all 19 properties in 2 ms. (steps per millisecond=108 )
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 2 places :
Implicit places reduction removed 2 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 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 14 place count 16 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 14 place count 16 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 16 place count 15 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 24 place count 11 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 26 place count 10 transition count 6
Applied a total of 26 rules in 16 ms. Remains 10 /24 variables (removed 14) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 10 cols
[2021-05-09 12:17:38] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-09 12:17:38] [INFO ] Implicit Places using invariants in 37 ms returned [4, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 40 ms to find 3 implicit places.
[2021-05-09 12:17:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-09 12:17:38] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 12:17:38] [INFO ] Dead Transitions using invariants and state equation in 14 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 2 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 12:17:38] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 12:17:38] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-09 12:17:38] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 12:17:38] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 24 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 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-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:(GEQ s2 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 15901 reset in 149 ms.
Product exploration explored 100000 steps with 14845 reset in 101 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15525 reset in 61 ms.
Product exploration explored 100000 steps with 15522 reset in 65 ms.
[2021-05-09 12:17:38] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:17:38] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:17:38] [INFO ] Time to serialize gal into /tmp/LTL6010046857944314309.gal : 1 ms
[2021-05-09 12:17:38] [INFO ] Time to serialize properties into /tmp/LTL9711719688727420203.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/LTL6010046857944314309.gal, -t, CGAL, -LTL, /tmp/LTL9711719688727420203.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/LTL6010046857944314309.gal -t CGAL -LTL /tmp/LTL9711719688727420203.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(MpG>=1)"))))
Formula 0 simplified : !GF"(MpG>=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
8 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.150883,18488,1,0,114,10544,24,83,196,10702,219
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0005P1-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ClientsAndServers-PT-N0005P1-00 finished in 1006 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0)||(p1 U X(p2))||(p3 U (p4||G(p3))))))], 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 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 12:17:39] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:17:39] [INFO ] Implicit Places using invariants in 21 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:17:39] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:17:39] [INFO ] Dead Transitions using invariants and state equation in 27 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:17:39] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:17:39] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 377 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p4) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-01 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p4) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=2 dest: 10}, { cond=(AND p1 (NOT p4) (NOT p3)), acceptance={} source=2 dest: 11}], [{ cond=(AND p1 (NOT p4) p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND p1 (NOT p4) p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p4) p3 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p4) p3), acceptance={} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 0}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}]], initial=1, aps=[p1:(AND (GEQ s4 1) (GEQ s18 1)), p4:(AND (OR (LT s4 1) (LT s18 1)) (LT s10 1)), p3:(LT s10 1), p0:(AND (GEQ s0 1) (GEQ s13 1)), p2:(GEQ s16 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, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 101 ms.
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Knowledge obtained : [(NOT p1), p4, p3, (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 396 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p4) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Applying partial POR strategy [true, false, false, false, true, false, true, true, false, true, true, false]
Stuttering acceptance computed with spot in 324 ms :[true, (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p3) (NOT p2)), (AND (NOT p4) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 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 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 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 4 place count 21 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 20 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 20 transition count 17
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 9 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
[2021-05-09 12:17:40] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-09 12:17:41] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:17:41] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/21 places, 17/18 transitions.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
[2021-05-09 12:17:41] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:17:41] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:17:41] [INFO ] Time to serialize gal into /tmp/LTL455114861769333468.gal : 0 ms
[2021-05-09 12:17:41] [INFO ] Time to serialize properties into /tmp/LTL18019609829150623985.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/LTL455114861769333468.gal, -t, CGAL, -LTL, /tmp/LTL18019609829150623985.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/LTL455114861769333468.gal -t CGAL -LTL /tmp/LTL18019609829150623985.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(((X("((Uf>=1)&&(MwU>=1))"))||(("((CA>=1)&&(CwA>=1))")U(X("(SpG>=1)"))))||(("(MtF<1)")U(("(((CA<1)||(CwA<1))&&(MtF<1))")||(G("(MtF<1)")))))))
Formula 0 simplified : !X(X"((Uf>=1)&&(MwU>=1))" | ("((CA>=1)&&(CwA>=1))" U X"(SpG>=1)") | ("(MtF<1)" U ("(((CA<1)||(CwA<1))&&(MtF<1))" | G"(MtF<1)")))
Detected timeout of ITS tools.
[2021-05-09 12:17:56] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:17:56] [INFO ] Applying decomposition
[2021-05-09 12:17:56] [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/graph9794510223893576514.txt, -o, /tmp/graph9794510223893576514.bin, -w, /tmp/graph9794510223893576514.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/graph9794510223893576514.bin, -l, -1, -v, -w, /tmp/graph9794510223893576514.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:17:56] [INFO ] Decomposing Gal with order
[2021-05-09 12:17:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:17:56] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:17:56] [INFO ] Flatten gal took : 62 ms
[2021-05-09 12:17:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:17:56] [INFO ] Time to serialize gal into /tmp/LTL8662395947977460706.gal : 7 ms
[2021-05-09 12:17:56] [INFO ] Time to serialize properties into /tmp/LTL8467737266157060299.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/LTL8662395947977460706.gal, -t, CGAL, -LTL, /tmp/LTL8467737266157060299.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/LTL8662395947977460706.gal -t CGAL -LTL /tmp/LTL8467737266157060299.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(((X("((u1.Uf>=1)&&(u5.MwU>=1))"))||(("((u3.CA>=1)&&(u2.CwA>=1))")U(X("(u4.SpG>=1)"))))||(("(u1.MtF<1)")U(("(((u3.CA<1)||(u2.CwA<1))&&(u1.MtF<1))")||(G("(u1.MtF<1)")))))))
Formula 0 simplified : !X(X"((u1.Uf>=1)&&(u5.MwU>=1))" | ("((u3.CA>=1)&&(u2.CwA>=1))" U X"(u4.SpG>=1)") | ("(u1.MtF<1)" U ("(((u3.CA<1)||(u2.CwA<1))&&(u1.MtF<1))" | G"(u1.MtF<1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13804523696916892338
[2021-05-09 12:18:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13804523696916892338
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/ltsmin13804523696916892338]
Compilation finished in 204 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13804523696916892338]
Link finished in 57 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, X((X((LTLAPp0==true))||((LTLAPp1==true) U X((LTLAPp2==true)))||((LTLAPp3==true) U ((LTLAPp4==true)||[]((LTLAPp3==true)))))), --buchi-type=spotba], workingDir=/tmp/ltsmin13804523696916892338]
LTSmin run took 262 ms.
FORMULA ClientsAndServers-PT-N0005P1-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0005P1-01 finished in 32822 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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 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:18:11] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:18:11] [INFO ] Implicit Places using invariants in 14 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 14 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:18:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:18:12] [INFO ] Dead Transitions using invariants and state equation in 39 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:18:12] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-09 12:18:12] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s19 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 354 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-03 finished in 160 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(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
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.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 18 transition count 12
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 14 place count 16 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 20 place count 13 transition count 9
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 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 12:18:12] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:18:12] [INFO ] Implicit Places using invariants in 21 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 22 ms to find 2 implicit places.
[2021-05-09 12:18:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:18:12] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:18:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Starting structural reductions, iteration 1 : 10/24 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2021-05-09 12:18:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-09 12:18:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:18:12] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 2 iterations. Remains : 10/24 places, 8/18 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-04 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s8 1)), p0:(GEQ s5 1)], nbAcceptance=0, 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 4618 reset in 124 ms.
Product exploration explored 100000 steps with 4583 reset in 136 ms.
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4553 reset in 114 ms.
Product exploration explored 100000 steps with 4585 reset in 138 ms.
[2021-05-09 12:18:12] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:18:12] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:18:12] [INFO ] Time to serialize gal into /tmp/LTL1775381771057926793.gal : 4 ms
[2021-05-09 12:18:12] [INFO ] Time to serialize properties into /tmp/LTL8152537590922880695.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/LTL1775381771057926793.gal, -t, CGAL, -LTL, /tmp/LTL8152537590922880695.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/LTL1775381771057926793.gal -t CGAL -LTL /tmp/LTL8152537590922880695.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(MpA>=1)"))U("((SF>=1)&&(Mi>=1))")))
Formula 0 simplified : !(F"(MpA>=1)" U "((SF>=1)&&(Mi>=1))")
Reverse transition relation is NOT exact ! Due to transitions t2.t12.t13.t14.t17, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/7/1/8
Computing Next relation with stutter on 1 deadlock states
106 unique states visited
106 strongly connected components in search stack
106 transitions explored
106 items max in DFS search stack
1180 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,11.8052,286632,1,0,6506,1.3223e+06,44,6773,407,1.67657e+06,12103
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ClientsAndServers-PT-N0005P1-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ClientsAndServers-PT-N0005P1-04 finished in 14175 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0) U (F(p1) U 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 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:18:26] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:18:26] [INFO ] Implicit Places using invariants in 19 ms returned [14, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 20 cols
[2021-05-09 12:18:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:18:26] [INFO ] Dead Transitions using invariants and state equation in 39 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:18:26] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-09 12:18:26] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-05 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s16 1), p1:(GEQ s15 1), p0:(AND (GEQ s0 1) (GEQ s13 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 30364 reset in 81 ms.
Product exploration explored 100000 steps with 30269 reset in 89 ms.
Knowledge obtained : [(NOT p2), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 30231 reset in 55 ms.
Product exploration explored 100000 steps with 30289 reset in 68 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p0 (NOT p2))]
Support contains 4 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 20/20 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 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 5 place count 20 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 20 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 18 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 18 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 18 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 17 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 17 transition count 15
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 16 rules in 5 ms. Remains 17 /20 variables (removed 3) and now considering 15/18 (removed 3) transitions.
[2021-05-09 12:18:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2021-05-09 12:18:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:18:27] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/20 places, 15/18 transitions.
Product exploration explored 100000 steps with 32672 reset in 226 ms.
Product exploration explored 100000 steps with 32492 reset in 145 ms.
[2021-05-09 12:18:27] [INFO ] Flatten gal took : 10 ms
[2021-05-09 12:18:27] [INFO ] Flatten gal took : 7 ms
[2021-05-09 12:18:27] [INFO ] Time to serialize gal into /tmp/LTL12381660196276687648.gal : 0 ms
[2021-05-09 12:18:27] [INFO ] Time to serialize properties into /tmp/LTL13081652944630128505.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/LTL12381660196276687648.gal, -t, CGAL, -LTL, /tmp/LTL13081652944630128505.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/LTL12381660196276687648.gal -t CGAL -LTL /tmp/LTL13081652944630128505.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((Uf>=1)&&(MwU>=1))"))U((F("(StR>=1)"))U("(SpG>=1)"))))
Formula 0 simplified : !(X"((Uf>=1)&&(MwU>=1))" U (F"(StR>=1)" U "(SpG>=1)"))
Detected timeout of ITS tools.
[2021-05-09 12:18:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:18:42] [INFO ] Applying decomposition
[2021-05-09 12:18:42] [INFO ] Flatten gal took : 1 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/graph12273433783976494174.txt, -o, /tmp/graph12273433783976494174.bin, -w, /tmp/graph12273433783976494174.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/graph12273433783976494174.bin, -l, -1, -v, -w, /tmp/graph12273433783976494174.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:18:42] [INFO ] Decomposing Gal with order
[2021-05-09 12:18:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:18:42] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:18:42] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:18:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:18:42] [INFO ] Time to serialize gal into /tmp/LTL14304767060839741108.gal : 1 ms
[2021-05-09 12:18:42] [INFO ] Time to serialize properties into /tmp/LTL7611045521344302546.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/LTL14304767060839741108.gal, -t, CGAL, -LTL, /tmp/LTL7611045521344302546.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/LTL14304767060839741108.gal -t CGAL -LTL /tmp/LTL7611045521344302546.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((X("((u1.Uf>=1)&&(u4.MwU>=1))"))U((F("(u4.StR>=1)"))U("(u3.SpG>=1)"))))
Formula 0 simplified : !(X"((u1.Uf>=1)&&(u4.MwU>=1))" U (F"(u4.StR>=1)" U "(u3.SpG>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5708853372514698127
[2021-05-09 12:18:58] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5708853372514698127
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/ltsmin5708853372514698127]
Compilation finished in 96 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin5708853372514698127]
Link finished in 27 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, (X((LTLAPp0==true)) U (<>((LTLAPp1==true)) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin5708853372514698127]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0005P1-05 finished in 46755 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(X(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 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:19:13] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Implicit Places using invariants in 16 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 18 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:19:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Dead Transitions using invariants and state equation in 19 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:19:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-06 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (LT s7 1) (LT s19 1)), p1:(LT s18 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-06 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(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 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 19 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 13 transition count 9
Applied a total of 20 rules in 5 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:19:13] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Implicit Places using invariants in 12 ms returned [8, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 12 ms to find 2 implicit places.
[2021-05-09 12:19:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 12:19:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Starting structural reductions, iteration 1 : 11/24 places, 9/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8 transition count 6
Applied a total of 6 rules in 1 ms. Remains 8 /11 variables (removed 3) and now considering 6/9 (removed 3) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 12:19:13] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-09 12:19:13] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-09 12:19:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 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 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 16917 steps with 190 reset in 16 ms.
FORMULA ClientsAndServers-PT-N0005P1-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-07 finished in 163 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p1)&&p0))))], 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 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 0 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 12:19:13] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Implicit Places using invariants in 26 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:19:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:13] [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 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:19:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s20 1), p0:(AND (GEQ s4 1) (GEQ s18 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0005P1-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-08 finished in 195 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(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 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:19:13] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Implicit Places using invariants in 13 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 14 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:19:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Dead Transitions using invariants and state equation in 147 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:19:13] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s2 1) (GEQ s14 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][false, false, false]]
Product exploration explored 100000 steps with 1934 reset in 69 ms.
Product exploration explored 100000 steps with 1864 reset in 77 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1873 reset in 73 ms.
Product exploration explored 100000 steps with 1888 reset in 87 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 21 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 21 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 19 transition count 16
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 15 rules in 3 ms. Remains 19 /21 variables (removed 2) and now considering 16/18 (removed 2) transitions.
[2021-05-09 12:19:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 16 rows 19 cols
[2021-05-09 12:19:14] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:14] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/21 places, 16/18 transitions.
Product exploration explored 100000 steps with 5971 reset in 67 ms.
Product exploration explored 100000 steps with 6000 reset in 66 ms.
[2021-05-09 12:19:14] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:19:14] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:19:14] [INFO ] Time to serialize gal into /tmp/LTL1898127174797856126.gal : 0 ms
[2021-05-09 12:19:14] [INFO ] Time to serialize properties into /tmp/LTL14670044892782112046.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/LTL1898127174797856126.gal, -t, CGAL, -LTL, /tmp/LTL14670044892782112046.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/LTL1898127174797856126.gal -t CGAL -LTL /tmp/LTL14670044892782112046.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((SF>=1)&&(Mi>=1))")))))
Formula 0 simplified : !XXF"((SF>=1)&&(Mi>=1))"
Detected timeout of ITS tools.
[2021-05-09 12:19:29] [INFO ] Flatten gal took : 4 ms
[2021-05-09 12:19:29] [INFO ] Applying decomposition
[2021-05-09 12:19:29] [INFO ] Flatten gal took : 3 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/graph16129395590932295815.txt, -o, /tmp/graph16129395590932295815.bin, -w, /tmp/graph16129395590932295815.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/graph16129395590932295815.bin, -l, -1, -v, -w, /tmp/graph16129395590932295815.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:19:29] [INFO ] Decomposing Gal with order
[2021-05-09 12:19:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:19:29] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:19:29] [INFO ] Flatten gal took : 1 ms
[2021-05-09 12:19:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:19:29] [INFO ] Time to serialize gal into /tmp/LTL6428960831982819111.gal : 0 ms
[2021-05-09 12:19:29] [INFO ] Time to serialize properties into /tmp/LTL6136648090903940597.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/LTL6428960831982819111.gal, -t, CGAL, -LTL, /tmp/LTL6136648090903940597.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/LTL6428960831982819111.gal -t CGAL -LTL /tmp/LTL6136648090903940597.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((u1.SF>=1)&&(i0.u4.Mi>=1))")))))
Formula 0 simplified : !XXF"((u1.SF>=1)&&(i0.u4.Mi>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14473865565912457571
[2021-05-09 12:19:44] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14473865565912457571
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/ltsmin14473865565912457571]
Compilation finished in 105 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin14473865565912457571]
Link finished in 29 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, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin14473865565912457571]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ClientsAndServers-PT-N0005P1-09 finished in 46063 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 20 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 10 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 16 place count 15 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 19 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 23 place count 11 transition count 8
Applied a total of 23 rules in 3 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:19:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:59] [INFO ] Implicit Places using invariants in 10 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 10 ms to find 2 implicit places.
[2021-05-09 12:19:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-09 12:19:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 12:19:59] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 9/24 places, 8/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 12:19:59] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 12:19:59] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2021-05-09 12:19:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 12:19:59] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 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 29 ms :[(NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3584 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0005P1-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-11 finished in 84 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((!p0 U (X(X(G(p1))) U G(!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 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:19:59] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:19:59] [INFO ] Implicit Places using invariants in 16 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:19:59] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:19:59] [INFO ] Dead Transitions using invariants and state equation in 10 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:19:59] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:19:59] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 209 ms :[p2, (NOT p1), p2, (AND p2 (NOT p1)), (NOT p1), true, (AND p2 (NOT p1)), (AND p2 p1)]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-12 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(LT s10 1), p0:(OR (LT s7 1) (LT s19 1)), p1:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-12 finished in 267 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(X((G((p0 U !p1))||(p2 U (p3||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 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 0 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-09 12:20:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Implicit Places using invariants in 20 ms returned [14, 21]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
// Phase 1: matrix 18 rows 21 cols
[2021-05-09 12:20:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 26 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:20:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3)), true, p1, p1, (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p3) p2) (AND p0 (NOT p3) p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p0 (NOT p3) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(OR (AND (NOT p1) (NOT p3) (NOT p2)) (AND p0 (NOT p3) (NOT p2))), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={} source=7 dest: 6}, { cond=(OR (NOT p1) p0), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(LT s19 1), p3:(AND (OR (LT s0 1) (LT s13 1)) (GEQ s1 1) (GEQ s17 1)), p2:(AND (GEQ s1 1) (GEQ s17 1)), p0:(GEQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0005P1-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-13 finished in 382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((p1||(F(p0) U 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
Performed 2 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 20 transition count 16
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 20 transition count 12
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 14 place count 16 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 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 2 with 2 rules applied. Total rules applied 18 place count 14 transition count 10
Applied a total of 18 rules in 4 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:20:00] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Implicit Places using invariants in 11 ms returned [6, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 11 ms to find 2 implicit places.
[2021-05-09 12:20:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 12:20:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Starting structural reductions, iteration 1 : 12/24 places, 10/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2021-05-09 12:20:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-09 12:20:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/24 places, 10/18 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-14 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 2} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={2} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 2} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 2} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s10 1)), p0:(AND (GEQ s3 1) (GEQ s9 1)), p2:(GEQ s11 1)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1735 reset in 198 ms.
Stack based approach found an accepted trace after 11063 steps with 188 reset with depth 53 and stack size 53 in 23 ms.
FORMULA ClientsAndServers-PT-N0005P1-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-14 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||(!p0 U 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 2 places :
Implicit places reduction removed 2 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 8 rules applied. Total rules applied 8 place count 22 transition count 12
Reduce places removed 6 places and 0 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 7 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 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 12 transition count 9
Applied a total of 21 rules in 1 ms. Remains 12 /24 variables (removed 12) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2021-05-09 12:20:00] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Implicit Places using invariants in 15 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
[2021-05-09 12:20:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 11 cols
[2021-05-09 12:20:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 11/24 places, 9/18 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 9 transition count 7
Applied a total of 4 rules in 1 ms. Remains 9 /11 variables (removed 2) and now considering 7/9 (removed 2) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:20:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-09 12:20:00] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-09 12:20:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-09 12:20:00] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 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 42 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0005P1-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s7 1), p1:(GEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 166 reset in 88 ms.
Stack based approach found an accepted trace after 3762 steps with 7 reset with depth 456 and stack size 450 in 3 ms.
FORMULA ClientsAndServers-PT-N0005P1-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0005P1-15 finished in 225 ms.
Using solver Z3 to compute partial order matrices.
[2021-05-09 12:20:01] [INFO ] Applying decomposition
[2021-05-09 12:20:01] [INFO ] Flatten gal took : 1 ms
Built C files in :
/tmp/ltsmin15878653578900727402
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/graph790584153073703015.txt, -o, /tmp/graph790584153073703015.bin, -w, /tmp/graph790584153073703015.weights], workingDir=null]
[2021-05-09 12:20:01] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2021-05-09 12:20:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:20:01] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2021-05-09 12:20:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph790584153073703015.bin, -l, -1, -v, -w, /tmp/graph790584153073703015.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 12:20:01] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2021-05-09 12:20:01] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-09 12:20:01] [INFO ] Decomposing Gal with order
[2021-05-09 12:20:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15878653578900727402
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/ltsmin15878653578900727402]
[2021-05-09 12:20:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 12:20:01] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-09 12:20:01] [INFO ] Flatten gal took : 2 ms
[2021-05-09 12:20:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-09 12:20:01] [INFO ] Time to serialize gal into /tmp/LTLFireability10736253060490180906.gal : 0 ms
[2021-05-09 12:20:01] [INFO ] Time to serialize properties into /tmp/LTLFireability502848048592323527.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/LTLFireability10736253060490180906.gal, -t, CGAL, -LTL, /tmp/LTLFireability502848048592323527.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/LTLFireability10736253060490180906.gal -t CGAL -LTL /tmp/LTLFireability502848048592323527.ltl -c -stutter-deadlock
Read 2 LTL properties
Checking formula 0 : !(((X("((i0.u0.Uf>=1)&&(i0.u0.MwU>=1))"))U((F("(u1.StR>=1)"))U("(u5.SpG>=1)"))))
Formula 0 simplified : !(X"((i0.u0.Uf>=1)&&(i0.u0.MwU>=1))" U (F"(u1.StR>=1)" U "(u5.SpG>=1)"))
Compilation finished in 136 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15878653578900727402]
Link finished in 30 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, (X((LTLAPp0==true)) U (<>((LTLAPp1==true)) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15878653578900727402]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: LTL layer: formula: (X((LTLAPp0==true)) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))
pins2lts-mc-linux64( 2/ 8), 0.005: "(X((LTLAPp0==true)) U (<>((LTLAPp1==true)) U (LTLAPp2==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.005: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.060: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.060: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.060: State length is 25, there are 35 groups
pins2lts-mc-linux64( 0/ 8), 0.060: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.060: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.060: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.060: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.167: ~78 levels ~960 states ~2032 transitions
pins2lts-mc-linux64( 0/ 8), 0.171: ~78 levels ~1920 states ~3352 transitions
pins2lts-mc-linux64( 0/ 8), 0.175: ~78 levels ~3840 states ~6800 transitions
pins2lts-mc-linux64( 0/ 8), 0.176: ~78 levels ~7680 states ~13600 transitions
pins2lts-mc-linux64( 1/ 8), 0.178: ~122 levels ~15360 states ~35568 transitions
pins2lts-mc-linux64( 7/ 8), 0.177: ~70 levels ~30720 states ~59000 transitions
pins2lts-mc-linux64( 0/ 8), 0.200: ~79 levels ~61440 states ~136768 transitions
pins2lts-mc-linux64( 2/ 8), 0.231: ~194 levels ~122880 states ~334960 transitions
pins2lts-mc-linux64( 5/ 8), 0.287: ~95 levels ~245760 states ~591304 transitions
pins2lts-mc-linux64( 5/ 8), 0.410: ~208 levels ~491520 states ~1295424 transitions
pins2lts-mc-linux64( 5/ 8), 0.720: ~208 levels ~983040 states ~2844184 transitions
pins2lts-mc-linux64( 5/ 8), 1.330: ~208 levels ~1966080 states ~6093800 transitions
pins2lts-mc-linux64( 5/ 8), 2.542: ~208 levels ~3932160 states ~12731568 transitions
pins2lts-mc-linux64( 5/ 8), 5.078: ~208 levels ~7864320 states ~26440808 transitions
pins2lts-mc-linux64( 6/ 8), 10.846: ~184 levels ~15728640 states ~53266824 transitions
pins2lts-mc-linux64( 4/ 8), 22.819: ~187 levels ~31457280 states ~112238344 transitions
pins2lts-mc-linux64( 1/ 8), 53.143: ~193 levels ~62914560 states ~244867400 transitions
pins2lts-mc-linux64( 2/ 8), 99.224: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 99.287:
pins2lts-mc-linux64( 0/ 8), 99.287: mean standard work distribution: 2.8% (states) 2.5% (transitions)
pins2lts-mc-linux64( 0/ 8), 99.287:
pins2lts-mc-linux64( 0/ 8), 99.287: Explored 100126076 states 395820254 transitions, fanout: 3.953
pins2lts-mc-linux64( 0/ 8), 99.287: Total exploration time 99.220 sec (99.140 sec minimum, 99.168 sec on average)
pins2lts-mc-linux64( 0/ 8), 99.287: States per second: 1009132, Transitions per second: 3989319
pins2lts-mc-linux64( 0/ 8), 99.287:
pins2lts-mc-linux64( 0/ 8), 99.287: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 99.287: Redundant explorations: 0.0090
pins2lts-mc-linux64( 0/ 8), 99.287:
pins2lts-mc-linux64( 0/ 8), 99.287: Queue width: 8B, total height: 1557, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 99.287: Tree memory: 1019.8MB, 10.7 B/state, compr.: 10.5%
pins2lts-mc-linux64( 0/ 8), 99.287: Tree fill ratio (roots/leafs): 74.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 99.287: Stored 18 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 99.287: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 99.287: Est. total memory use: 1019.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing 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, (X((LTLAPp0==true)) U (<>((LTLAPp1==true)) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15878653578900727402]
255
java.lang.RuntimeException: Unexpected exception when executing 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, (X((LTLAPp0==true)) U (<>((LTLAPp1==true)) U (LTLAPp2==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin15878653578900727402]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-09 12:40:48] [INFO ] Flatten gal took : 8 ms
[2021-05-09 12:40:48] [INFO ] Time to serialize gal into /tmp/LTLFireability10925315603655391493.gal : 1 ms
[2021-05-09 12:40:48] [INFO ] Time to serialize properties into /tmp/LTLFireability13614241424253172040.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/LTLFireability10925315603655391493.gal, -t, CGAL, -LTL, /tmp/LTLFireability13614241424253172040.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/LTLFireability10925315603655391493.gal -t CGAL -LTL /tmp/LTLFireability13614241424253172040.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 2 LTL properties
Checking formula 0 : !(((X("((Uf>=1)&&(MwU>=1))"))U((F("(StR>=1)"))U("(SpG>=1)"))))
Formula 0 simplified : !(X"((Uf>=1)&&(MwU>=1))" U (F"(StR>=1)" U "(SpG>=1)"))
Reverse transition relation is NOT exact ! Due to transitions ssA, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-09 13:01:35] [INFO ] Flatten gal took : 2 ms
[2021-05-09 13:01:35] [INFO ] Input system was already deterministic with 18 transitions.
[2021-05-09 13:01:35] [INFO ] Transformed 24 places.
[2021-05-09 13:01:35] [INFO ] Transformed 18 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-09 13:01:35] [INFO ] Time to serialize gal into /tmp/LTLFireability11056489323803319325.gal : 0 ms
[2021-05-09 13:01:35] [INFO ] Time to serialize properties into /tmp/LTLFireability157251015543278106.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/LTLFireability11056489323803319325.gal, -t, CGAL, -LTL, /tmp/LTLFireability157251015543278106.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --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/LTLFireability11056489323803319325.gal -t CGAL -LTL /tmp/LTLFireability157251015543278106.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((X("((Uf>=1)&&(MwU>=1))"))U((F("(StR>=1)"))U("(SpG>=1)"))))
Formula 0 simplified : !(X"((Uf>=1)&&(MwU>=1))" U (F"(StR>=1)" U "(SpG>=1)"))
Reverse transition relation is NOT exact ! Due to transitions t13, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/17/1/18
Computing Next relation with stutter on 1 deadlock states

BK_TIME_CONFINEMENT_REACHED

--------------------
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-N0005P1"
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-N0005P1, 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-162038291500141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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