Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r254-tall-162106746400757.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SwimmingPool-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400757
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 14:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 14:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 20:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 3.9K May 5 16:52 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 SwimmingPool-PT-06-00
FORMULA_NAME SwimmingPool-PT-06-01
FORMULA_NAME SwimmingPool-PT-06-02
FORMULA_NAME SwimmingPool-PT-06-03
FORMULA_NAME SwimmingPool-PT-06-04
FORMULA_NAME SwimmingPool-PT-06-05
FORMULA_NAME SwimmingPool-PT-06-06
FORMULA_NAME SwimmingPool-PT-06-07
FORMULA_NAME SwimmingPool-PT-06-08
FORMULA_NAME SwimmingPool-PT-06-09
FORMULA_NAME SwimmingPool-PT-06-10
FORMULA_NAME SwimmingPool-PT-06-11
FORMULA_NAME SwimmingPool-PT-06-12
FORMULA_NAME SwimmingPool-PT-06-13
FORMULA_NAME SwimmingPool-PT-06-14
FORMULA_NAME SwimmingPool-PT-06-15

=== Now, execution of the tool begins

BK_START 1621274002133

Running Version 0
[2021-05-17 17:53:24] [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-17 17:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 17:53:24] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-17 17:53:24] [INFO ] Transformed 9 places.
[2021-05-17 17:53:24] [INFO ] Transformed 7 transitions.
[2021-05-17 17:53:24] [INFO ] Parsed PT model containing 9 places and 7 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 17:53:24] [INFO ] Initial state test concluded for 3 properties.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 12 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:24] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 17:53:24] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:24] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 17:53:24] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:53:24] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 17:53:24] [INFO ] Initial state reduction rules for LTL removed 4 formulas.
[2021-05-17 17:53:24] [INFO ] Flatten gal took : 15 ms
FORMULA SwimmingPool-PT-06-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-06-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 17:53:24] [INFO ] Flatten gal took : 3 ms
[2021-05-17 17:53:24] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 426 steps, including 0 resets, run visited all 8 properties in 2 ms. (steps per millisecond=213 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:53:24] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:24] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-17 17:53:24] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:53:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 159 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 11 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 17:53:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:53:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:53:25] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
[2021-05-17 17:53:26] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:53:26] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:53:26] [INFO ] Time to serialize gal into /tmp/LTL16024313646468103222.gal : 1 ms
[2021-05-17 17:53:26] [INFO ] Time to serialize properties into /tmp/LTL17270838766120272548.ltl : 8 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/LTL16024313646468103222.gal, -t, CGAL, -LTL, /tmp/LTL17270838766120272548.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/LTL16024313646468103222.gal -t CGAL -LTL /tmp/LTL17270838766120272548.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(Out>=1)"))))
Formula 0 simplified : !XF"(Out>=1)"
Detected timeout of ITS tools.
[2021-05-17 17:53:41] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:53:41] [INFO ] Applying decomposition
[2021-05-17 17:53:41] [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/graph6784441861857624636.txt, -o, /tmp/graph6784441861857624636.bin, -w, /tmp/graph6784441861857624636.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/graph6784441861857624636.bin, -l, -1, -v, -w, /tmp/graph6784441861857624636.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:53:41] [INFO ] Decomposing Gal with order
[2021-05-17 17:53:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:53:41] [INFO ] Flatten gal took : 19 ms
[2021-05-17 17:53:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:53:41] [INFO ] Time to serialize gal into /tmp/LTL2492553311535872757.gal : 1 ms
[2021-05-17 17:53:41] [INFO ] Time to serialize properties into /tmp/LTL7779439899642915045.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/LTL2492553311535872757.gal, -t, CGAL, -LTL, /tmp/LTL7779439899642915045.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/LTL2492553311535872757.gal -t CGAL -LTL /tmp/LTL7779439899642915045.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("(u0.Out>=1)"))))
Formula 0 simplified : !XF"(u0.Out>=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8830293889173316452
[2021-05-17 17:53:56] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8830293889173316452
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/ltsmin8830293889173316452]
Compilation finished in 153 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8830293889173316452]
Link finished in 36 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))), --buchi-type=spotba], workingDir=/tmp/ltsmin8830293889173316452]
LTSmin run took 867 ms.
FORMULA SwimmingPool-PT-06-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-06-03 finished in 32763 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 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 4 place count 7 transition count 5
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 6 place count 6 transition count 4
Applied a total of 6 rules in 6 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:53:57] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:53:57] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:53:57] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:53:57] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-17 17:53:57] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:53:57] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 17:53:57] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 15178 reset in 163 ms.
Product exploration explored 100000 steps with 15031 reset in 105 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15183 reset in 56 ms.
Product exploration explored 100000 steps with 15082 reset in 115 ms.
[2021-05-17 17:53:58] [INFO ] Flatten gal took : 8 ms
[2021-05-17 17:53:58] [INFO ] Flatten gal took : 0 ms
[2021-05-17 17:53:58] [INFO ] Time to serialize gal into /tmp/LTL11752431641677531939.gal : 0 ms
[2021-05-17 17:53:58] [INFO ] Time to serialize properties into /tmp/LTL13472027924662100880.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/LTL11752431641677531939.gal, -t, CGAL, -LTL, /tmp/LTL13472027924662100880.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/LTL11752431641677531939.gal -t CGAL -LTL /tmp/LTL13472027924662100880.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("(Dress>=1)")))
Formula 0 simplified : !F"(Dress>=1)"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
581 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,5.81473,86956,1,0,1055,282327,20,212,609,291895,2113
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-06-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SwimmingPool-PT-06-04 finished in 6650 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:04] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:54:04] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:04] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:04] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:54:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-06-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s2 1), p1:(LT s5 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 15156 reset in 84 ms.
Product exploration explored 100000 steps with 15064 reset in 101 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 15114 reset in 69 ms.
Product exploration explored 100000 steps with 15101 reset in 73 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 17:54:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:04] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 19023 reset in 144 ms.
Product exploration explored 100000 steps with 18990 reset in 91 ms.
[2021-05-17 17:54:05] [INFO ] Flatten gal took : 4 ms
[2021-05-17 17:54:05] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:54:05] [INFO ] Time to serialize gal into /tmp/LTL8269713427984239224.gal : 1 ms
[2021-05-17 17:54:05] [INFO ] Time to serialize properties into /tmp/LTL7993940230948871356.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/LTL8269713427984239224.gal, -t, CGAL, -LTL, /tmp/LTL7993940230948871356.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/LTL8269713427984239224.gal -t CGAL -LTL /tmp/LTL7993940230948871356.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("(Undress>=1)"))||(G("(Dressed<1)")))))
Formula 0 simplified : !X(F"(Undress>=1)" | G"(Dressed<1)")
Detected timeout of ITS tools.
[2021-05-17 17:54:20] [INFO ] Flatten gal took : 17 ms
[2021-05-17 17:54:20] [INFO ] Applying decomposition
[2021-05-17 17:54:20] [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/graph9216990959095329036.txt, -o, /tmp/graph9216990959095329036.bin, -w, /tmp/graph9216990959095329036.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/graph9216990959095329036.bin, -l, -1, -v, -w, /tmp/graph9216990959095329036.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:54:20] [INFO ] Decomposing Gal with order
[2021-05-17 17:54:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:54:20] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:54:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:54:20] [INFO ] Time to serialize gal into /tmp/LTL15132871164898681636.gal : 0 ms
[2021-05-17 17:54:20] [INFO ] Time to serialize properties into /tmp/LTL7531764462053443977.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/LTL15132871164898681636.gal, -t, CGAL, -LTL, /tmp/LTL7531764462053443977.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/LTL15132871164898681636.gal -t CGAL -LTL /tmp/LTL7531764462053443977.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((F("(u1.Undress>=1)"))||(G("(u0.Dressed<1)")))))
Formula 0 simplified : !X(F"(u1.Undress>=1)" | G"(u0.Dressed<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3291201135166469759
[2021-05-17 17:54:35] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3291201135166469759
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/ltsmin3291201135166469759]
Compilation finished in 98 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin3291201135166469759]
Link finished in 31 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))||[]((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin3291201135166469759]
LTSmin run took 380 ms.
FORMULA SwimmingPool-PT-06-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-06-05 finished in 31588 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 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 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:54:35] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:54:35] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:54:35] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:35] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 17:54:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:54:35] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:35] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-06 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(GEQ s3 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 215 reset in 125 ms.
Stack based approach found an accepted trace after 6529 steps with 5 reset with depth 6442 and stack size 6280 in 21 ms.
FORMULA SwimmingPool-PT-06-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-06 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(X(G((G(!p1)||X(X(X(X(p2))))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:36] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:54:36] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:36] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:36] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:36] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 2209 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (NOT p0), (AND (NOT p0) p1 p2)]
Running random walk in product with property : SwimmingPool-PT-06-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=true, acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0, 1} source=1 dest: 3}, { cond=(NOT p1), acceptance={1} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={0, 1} source=3 dest: 7}, { cond=true, acceptance={0} source=3 dest: 8}, { cond=(NOT p0), acceptance={} source=3 dest: 9}, { cond=(NOT p1), acceptance={1} source=3 dest: 10}], [{ cond=p1, acceptance={0, 1} source=4 dest: 7}, { cond=p1, acceptance={0} source=4 dest: 8}, { cond=(NOT p0), acceptance={} source=4 dest: 9}, { cond=(NOT p1), acceptance={1} source=4 dest: 10}, { cond=(NOT p1), acceptance={} source=4 dest: 11}], [{ cond=(NOT p0), acceptance={} source=5 dest: 12}], [{ cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 12}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 13}], [{ cond=p1, acceptance={0, 1} source=7 dest: 14}, { cond=true, acceptance={0} source=7 dest: 15}, { cond=(NOT p0), acceptance={} source=7 dest: 16}, { cond=(NOT p1), acceptance={1} source=7 dest: 17}], [{ cond=p1, acceptance={0, 1} source=8 dest: 18}, { cond=true, acceptance={0} source=8 dest: 19}, { cond=(NOT p0), acceptance={} source=8 dest: 20}, { cond=(NOT p1), acceptance={1} source=8 dest: 21}], [{ cond=(NOT p0), acceptance={} source=9 dest: 22}], [{ cond=p1, acceptance={0, 1} source=10 dest: 14}, { cond=p1, acceptance={0} source=10 dest: 15}, { cond=(NOT p0), acceptance={} source=10 dest: 16}, { cond=(NOT p1), acceptance={1} source=10 dest: 17}, { cond=(NOT p1), acceptance={} source=10 dest: 23}], [{ cond=p1, acceptance={0, 1} source=11 dest: 18}, { cond=p1, acceptance={0} source=11 dest: 19}, { cond=(NOT p0), acceptance={} source=11 dest: 20}, { cond=(NOT p1), acceptance={1} source=11 dest: 21}, { cond=(NOT p1), acceptance={} source=11 dest: 24}], [{ cond=(NOT p0), acceptance={} source=12 dest: 25}], [{ cond=(AND (NOT p0) p1), acceptance={} source=13 dest: 25}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 26}], [{ cond=p1, acceptance={0, 1} source=14 dest: 27}, { cond=true, acceptance={0} source=14 dest: 28}, { cond=(NOT p0), acceptance={} source=14 dest: 29}, { cond=(NOT p1), acceptance={1} source=14 dest: 30}], [{ cond=p1, acceptance={0, 1} source=15 dest: 31}, { cond=true, acceptance={0} source=15 dest: 32}, { cond=(NOT p0), acceptance={} source=15 dest: 33}, { cond=(NOT p1), acceptance={1} source=15 dest: 34}], [{ cond=(NOT p0), acceptance={} source=16 dest: 35}], [{ cond=p1, acceptance={0, 1} source=17 dest: 27}, { cond=p1, acceptance={0} source=17 dest: 28}, { cond=(NOT p0), acceptance={} source=17 dest: 29}, { cond=(NOT p1), acceptance={1} source=17 dest: 30}, { cond=(NOT p1), acceptance={} source=17 dest: 36}], [{ cond=p1, acceptance={0, 1} source=18 dest: 37}, { cond=true, acceptance={0} source=18 dest: 38}, { cond=(NOT p0), acceptance={} source=18 dest: 39}, { cond=(NOT p1), acceptance={1} source=18 dest: 40}], [{ cond=p1, acceptance={0, 1} source=19 dest: 41}, { cond=true, acceptance={0} source=19 dest: 42}, { cond=(NOT p0), acceptance={} source=19 dest: 43}, { cond=(NOT p1), acceptance={1} source=19 dest: 44}], [{ cond=(NOT p0), acceptance={} source=20 dest: 45}], [{ cond=p1, acceptance={0, 1} source=21 dest: 37}, { cond=p1, acceptance={0} source=21 dest: 38}, { cond=(NOT p0), acceptance={} source=21 dest: 39}, { cond=(NOT p1), acceptance={1} source=21 dest: 40}, { cond=(NOT p1), acceptance={} source=21 dest: 46}], [{ cond=(NOT p0), acceptance={} source=22 dest: 45}, { cond=(AND (NOT p0) p1), acceptance={} source=22 dest: 47}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=22 dest: 48}], [{ cond=p1, acceptance={0, 1} source=23 dest: 31}, { cond=p1, acceptance={0} source=23 dest: 32}, { cond=(NOT p0), acceptance={} source=23 dest: 33}, { cond=(NOT p1), acceptance={1} source=23 dest: 34}, { cond=(NOT p1), acceptance={} source=23 dest: 49}], [{ cond=p1, acceptance={0, 1} source=24 dest: 41}, { cond=p1, acceptance={0} source=24 dest: 42}, { cond=(NOT p0), acceptance={} source=24 dest: 43}, { cond=(NOT p1), acceptance={1} source=24 dest: 44}, { cond=(NOT p1), acceptance={} source=24 dest: 50}], [{ cond=(NOT p0), acceptance={} source=25 dest: 51}], [{ cond=(AND (NOT p0) p1), acceptance={} source=26 dest: 51}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=26 dest: 52}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=27 dest: 27}, { cond=(NOT p2), acceptance={0} source=27 dest: 28}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=27 dest: 29}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=27 dest: 30}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=28 dest: 31}, { cond=(NOT p2), acceptance={0} source=28 dest: 32}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=28 dest: 33}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=28 dest: 34}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=29 dest: 35}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=30 dest: 27}, { cond=(AND p1 (NOT p2)), acceptance={0} source=30 dest: 28}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=30 dest: 29}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=30 dest: 30}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=30 dest: 36}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=31 dest: 37}, { cond=(NOT p2), acceptance={0} source=31 dest: 38}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=31 dest: 39}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=31 dest: 40}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=32 dest: 41}, { cond=(NOT p2), acceptance={0} source=32 dest: 42}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=32 dest: 43}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=32 dest: 44}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=33 dest: 45}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=34 dest: 37}, { cond=(AND p1 (NOT p2)), acceptance={0} source=34 dest: 38}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=34 dest: 39}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=34 dest: 40}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=34 dest: 46}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=35 dest: 45}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=35 dest: 47}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=35 dest: 48}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=36 dest: 31}, { cond=(AND p1 (NOT p2)), acceptance={0} source=36 dest: 32}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=36 dest: 33}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=36 dest: 34}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=36 dest: 49}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=37 dest: 14}, { cond=(NOT p2), acceptance={0} source=37 dest: 15}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=37 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=37 dest: 17}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=38 dest: 18}, { cond=(NOT p2), acceptance={0} source=38 dest: 19}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=38 dest: 20}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=38 dest: 21}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=39 dest: 22}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=40 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={0} source=40 dest: 15}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=40 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=40 dest: 17}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=40 dest: 23}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=41 dest: 7}, { cond=(NOT p2), acceptance={0} source=41 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=41 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=41 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=42 dest: 0}, { cond=(NOT p2), acceptance={0} source=42 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=42 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=42 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=43 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=44 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={0} source=44 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=44 dest: 9}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=44 dest: 10}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=44 dest: 11}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=45 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=45 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=45 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=46 dest: 18}, { cond=(AND p1 (NOT p2)), acceptance={0} source=46 dest: 19}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=46 dest: 20}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=46 dest: 21}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=46 dest: 24}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=47 dest: 12}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=48 dest: 12}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=48 dest: 13}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=49 dest: 41}, { cond=(AND p1 (NOT p2)), acceptance={0} source=49 dest: 42}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=49 dest: 43}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=49 dest: 44}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=49 dest: 50}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=50 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=50 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=50 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=50 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=50 dest: 53}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=51 dest: 54}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=52 dest: 54}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=52 dest: 55}], [{ cond=(AND (NOT p0) p2), acceptance={} source=53 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=53 dest: 1}, { cond=(AND p1 p2), acceptance={0, 1} source=53 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={1} source=53 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=53 dest: 53}], [{ cond=(NOT p0), acceptance={0, 1} source=54 dest: 54}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=55 dest: 54}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=55 dest: 55}]], initial=1, aps=[p0:(GEQ s4 1), p1:(GEQ s2 1), p2:(OR (LT s3 1) (LT s7 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13395 reset in 98 ms.
Product exploration explored 100000 steps with 13325 reset in 125 ms.
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 1898 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (NOT p0), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 13275 reset in 78 ms.
Product exploration explored 100000 steps with 13343 reset in 87 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, true, false, true, true]
Stuttering acceptance computed with spot in 1891 ms :[(AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), false, (NOT p0), (AND (NOT p0) p1 p2)]
Support contains 4 out of 9 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 17:54:44] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:54:44] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:54:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 13383 reset in 129 ms.
Product exploration explored 100000 steps with 13372 reset in 135 ms.
[2021-05-17 17:54:44] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:54:44] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:54:44] [INFO ] Time to serialize gal into /tmp/LTL7253771379775610259.gal : 1 ms
[2021-05-17 17:54:44] [INFO ] Time to serialize properties into /tmp/LTL5328997394062536426.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/LTL7253771379775610259.gal, -t, CGAL, -LTL, /tmp/LTL5328997394062536426.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/LTL7253771379775610259.gal -t CGAL -LTL /tmp/LTL5328997394062536426.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(Dress>=1)"))U(X(X(G((G("(Undress<1)"))||(X(X(X(X("((InBath<1)||(Cabins<1))")))))))))))
Formula 0 simplified : !(F"(Dress>=1)" U XXG(G"(Undress<1)" | XXXX"((InBath<1)||(Cabins<1))"))
Detected timeout of ITS tools.
[2021-05-17 17:55:00] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:55:00] [INFO ] Applying decomposition
[2021-05-17 17:55:00] [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/graph7586584259413884099.txt, -o, /tmp/graph7586584259413884099.bin, -w, /tmp/graph7586584259413884099.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/graph7586584259413884099.bin, -l, -1, -v, -w, /tmp/graph7586584259413884099.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:55:00] [INFO ] Decomposing Gal with order
[2021-05-17 17:55:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:55:00] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:55:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:55:00] [INFO ] Time to serialize gal into /tmp/LTL1638178467156781290.gal : 0 ms
[2021-05-17 17:55:00] [INFO ] Time to serialize properties into /tmp/LTL11679217914479030424.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/LTL1638178467156781290.gal, -t, CGAL, -LTL, /tmp/LTL11679217914479030424.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/LTL1638178467156781290.gal -t CGAL -LTL /tmp/LTL11679217914479030424.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(u0.Dress>=1)"))U(X(X(G((G("(u2.Undress<1)"))||(X(X(X(X("((u0.InBath<1)||(u2.Cabins<1))")))))))))))
Formula 0 simplified : !(F"(u0.Dress>=1)" U XXG(G"(u2.Undress<1)" | XXXX"((u0.InBath<1)||(u2.Cabins<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4623838565756850467
[2021-05-17 17:55:15] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4623838565756850467
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/ltsmin4623838565756850467]
Compilation finished in 100 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4623838565756850467]
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, (<>((LTLAPp0==true)) U X(X([](([]((LTLAPp1==true))||X(X(X(X((LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin4623838565756850467]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-06-07 finished in 54041 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 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 4 place count 7 transition count 5
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:55:30] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:55:30] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:55:30] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:55:30] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 17:55:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:55:30] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-17 17:55:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1040 reset in 69 ms.
Product exploration explored 100000 steps with 1044 reset in 96 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 890 reset in 71 ms.
Product exploration explored 100000 steps with 1006 reset in 88 ms.
[2021-05-17 17:55:30] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:55:30] [INFO ] Flatten gal took : 0 ms
[2021-05-17 17:55:30] [INFO ] Time to serialize gal into /tmp/LTL14595396755252785961.gal : 0 ms
[2021-05-17 17:55:30] [INFO ] Time to serialize properties into /tmp/LTL1619679570936360631.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/LTL14595396755252785961.gal, -t, CGAL, -LTL, /tmp/LTL1619679570936360631.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/LTL14595396755252785961.gal -t CGAL -LTL /tmp/LTL1619679570936360631.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("((Entered>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !GF"((Entered>=1)&&(Cabins>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 17:55:45] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:55:45] [INFO ] Applying decomposition
[2021-05-17 17:55:45] [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/graph9230897661864273293.txt, -o, /tmp/graph9230897661864273293.bin, -w, /tmp/graph9230897661864273293.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/graph9230897661864273293.bin, -l, -1, -v, -w, /tmp/graph9230897661864273293.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:55:45] [INFO ] Decomposing Gal with order
[2021-05-17 17:55:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:55:45] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:55:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:55:45] [INFO ] Time to serialize gal into /tmp/LTL13184111110047071222.gal : 1 ms
[2021-05-17 17:55:45] [INFO ] Time to serialize properties into /tmp/LTL5483179087286488461.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/LTL13184111110047071222.gal, -t, CGAL, -LTL, /tmp/LTL5483179087286488461.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/LTL13184111110047071222.gal -t CGAL -LTL /tmp/LTL5483179087286488461.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G(F("((u0.Entered>=1)&&(u1.Cabins>=1))"))))
Formula 0 simplified : !GF"((u0.Entered>=1)&&(u1.Cabins>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4369092618622851051
[2021-05-17 17:56:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4369092618622851051
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/ltsmin4369092618622851051]
Compilation finished in 88 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4369092618622851051]
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, [](<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin4369092618622851051]
LTSmin run took 4485 ms.
FORMULA SwimmingPool-PT-06-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-06-10 finished in 35164 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)||G(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 9 transition count 6
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:56:05] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:05] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-17 17:56:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 61 ms :[false, p1, p1]
Running random walk in product with property : SwimmingPool-PT-06-11 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 556 reset in 70 ms.
Stack based approach found an accepted trace after 46 steps with 4 reset with depth 21 and stack size 21 in 0 ms.
FORMULA SwimmingPool-PT-06-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-11 finished in 213 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 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 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 4 place count 7 transition count 5
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 6 place count 6 transition count 4
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:56:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:05] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:56:05] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:05] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-17 17:56:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:56:05] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:56:05] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-06-12 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:(GEQ s2 1), p1:(AND (GEQ s0 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 58 reset in 142 ms.
Product exploration explored 100000 steps with 76 reset in 84 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 80 reset in 63 ms.
Product exploration explored 100000 steps with 62 reset in 77 ms.
[2021-05-17 17:56:06] [INFO ] Flatten gal took : 0 ms
[2021-05-17 17:56:06] [INFO ] Flatten gal took : 0 ms
[2021-05-17 17:56:06] [INFO ] Time to serialize gal into /tmp/LTL5798478912437938457.gal : 0 ms
[2021-05-17 17:56:06] [INFO ] Time to serialize properties into /tmp/LTL1180917737315430928.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/LTL5798478912437938457.gal, -t, CGAL, -LTL, /tmp/LTL1180917737315430928.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/LTL5798478912437938457.gal -t CGAL -LTL /tmp/LTL1180917737315430928.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Dress>=1)")||(F("((WaitBag>=1)&&(Bags>=1))"))))))
Formula 0 simplified : !FG("(Dress>=1)" | F"((WaitBag>=1)&&(Bags>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
663 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,6.63427,96248,1,0,929,322329,34,240,623,352665,2070
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-06-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-06-12 finished in 7466 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:56:12] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:12] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:56:12] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-17 17:56:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:12] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 17:56:12] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 22 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-06-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s5 1) (GEQ s4 1)), p0:(AND (GEQ s1 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24996 reset in 74 ms.
Product exploration explored 100000 steps with 24992 reset in 86 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 20 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25046 reset in 76 ms.
Product exploration explored 100000 steps with 24998 reset in 78 ms.
[2021-05-17 17:56:13] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:56:13] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:56:13] [INFO ] Time to serialize gal into /tmp/LTL2963663929783272087.gal : 1 ms
[2021-05-17 17:56:13] [INFO ] Time to serialize properties into /tmp/LTL9711190086524924951.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/LTL2963663929783272087.gal, -t, CGAL, -LTL, /tmp/LTL9711190086524924951.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/LTL2963663929783272087.gal -t CGAL -LTL /tmp/LTL9711190086524924951.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((Out>=1)||(Dressed>=1))"))||("((WaitBag>=1)&&(Bags>=1))"))))
Formula 0 simplified : !F("((WaitBag>=1)&&(Bags>=1))" | G"((Out>=1)||(Dressed>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
754 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,7.55744,102488,1,0,724,573360,28,244,837,570766,1579
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-06-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-06-13 finished in 8440 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 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 4 place count 7 transition count 5
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 6 place count 6 transition count 4
Applied a total of 6 rules in 1 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:56:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:56:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:21] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2021-05-17 17:56:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:56:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:21] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-06-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s0 1) (GEQ s5 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 71 ms.
Knowledge obtained : [(NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 67 ms.
[2021-05-17 17:56:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:56:21] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:56:21] [INFO ] Time to serialize gal into /tmp/LTL12236291217069318860.gal : 0 ms
[2021-05-17 17:56:21] [INFO ] Time to serialize properties into /tmp/LTL18038002176996086861.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/LTL12236291217069318860.gal, -t, CGAL, -LTL, /tmp/LTL18038002176996086861.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/LTL12236291217069318860.gal -t CGAL -LTL /tmp/LTL18038002176996086861.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("((WaitBag>=1)&&(Bags>=1))"))||(G("(Dress>=1)"))))
Formula 0 simplified : !(F"((WaitBag>=1)&&(Bags>=1))" | G"(Dress>=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
352 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.53053,54732,1,0,6,204833,29,0,616,203341,14
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-06-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SwimmingPool-PT-06-14 finished in 4112 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:25] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:25] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:56:25] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2021-05-17 17:56:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:56:25] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:56:25] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-06-15 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=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s5 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 5665 steps with 0 reset in 4 ms.
FORMULA SwimmingPool-PT-06-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-06-15 finished in 156 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin173033411356414323
[2021-05-17 17:56:25] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 17:56:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:56:25] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 17:56:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:56:25] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 17:56:25] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:56:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin173033411356414323
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/ltsmin173033411356414323]
[2021-05-17 17:56:25] [INFO ] Applying decomposition
[2021-05-17 17:56:25] [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/graph16552602041363550741.txt, -o, /tmp/graph16552602041363550741.bin, -w, /tmp/graph16552602041363550741.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/graph16552602041363550741.bin, -l, -1, -v, -w, /tmp/graph16552602041363550741.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:56:25] [INFO ] Decomposing Gal with order
[2021-05-17 17:56:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:56:25] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:56:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:56:25] [INFO ] Time to serialize gal into /tmp/LTLFireability405127773734557188.gal : 0 ms
[2021-05-17 17:56:25] [INFO ] Time to serialize properties into /tmp/LTLFireability3265585670419801675.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/LTLFireability405127773734557188.gal, -t, CGAL, -LTL, /tmp/LTLFireability3265585670419801675.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/LTLFireability405127773734557188.gal -t CGAL -LTL /tmp/LTLFireability3265585670419801675.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !(((F("(u2.Dress>=1)"))U(X(X(G((G("(u1.Undress<1)"))||(X(X(X(X(!("((u2.InBath>=1)&&(u1.Cabins>=1))"))))))))))))
Formula 0 simplified : !(F"(u2.Dress>=1)" U XXG(G"(u1.Undress<1)" | XXXX!"((u2.InBath>=1)&&(u1.Cabins>=1))"))
Compilation finished in 125 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin173033411356414323]
Link finished in 31 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, (<>((LTLAPp0==true)) U X(X([](([](!(LTLAPp1==true))||X(X(X(X((LTLAPp2==true)))))))))), --buchi-type=spotba], workingDir=/tmp/ltsmin173033411356414323]
LTSmin run took 362 ms.
FORMULA SwimmingPool-PT-06-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621274187108

--------------------
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="SwimmingPool-PT-06"
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 SwimmingPool-PT-06, 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 r254-tall-162106746400757"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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