About the Execution of ITS-Tools for SwimmingPool-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7491.756 | 3600000.00 | 4095173.00 | 7990.30 | TFTTFFFFFF?FFTTF | normal |
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-162106746400749.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-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106746400749
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 352K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K 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.6K Mar 28 16:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 15K Mar 28 16:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.8K Mar 25 20:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-05-00
FORMULA_NAME SwimmingPool-PT-05-01
FORMULA_NAME SwimmingPool-PT-05-02
FORMULA_NAME SwimmingPool-PT-05-03
FORMULA_NAME SwimmingPool-PT-05-04
FORMULA_NAME SwimmingPool-PT-05-05
FORMULA_NAME SwimmingPool-PT-05-06
FORMULA_NAME SwimmingPool-PT-05-07
FORMULA_NAME SwimmingPool-PT-05-08
FORMULA_NAME SwimmingPool-PT-05-09
FORMULA_NAME SwimmingPool-PT-05-10
FORMULA_NAME SwimmingPool-PT-05-11
FORMULA_NAME SwimmingPool-PT-05-12
FORMULA_NAME SwimmingPool-PT-05-13
FORMULA_NAME SwimmingPool-PT-05-14
FORMULA_NAME SwimmingPool-PT-05-15
=== Now, execution of the tool begins
BK_START 1621272913094
Running Version 0
[2021-05-17 17:35:14] [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:35:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 17:35:14] [INFO ] Load time of PNML (sax parser for PT used): 18 ms
[2021-05-17 17:35:14] [INFO ] Transformed 9 places.
[2021-05-17 17:35:14] [INFO ] Transformed 7 transitions.
[2021-05-17 17:35:14] [INFO ] Parsed PT model containing 9 places and 7 transitions in 53 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 17:35:14] [INFO ] Initial state test concluded for 4 properties.
FORMULA SwimmingPool-PT-05-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-05-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-05-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 7 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:35:14] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-17 17:35:14] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:14] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:14] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:14] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-17 17:35:14] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
[2021-05-17 17:35:15] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 17:35:15] [INFO ] Flatten gal took : 18 ms
FORMULA SwimmingPool-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 17:35:15] [INFO ] Flatten gal took : 3 ms
[2021-05-17 17:35:15] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 356 steps, including 0 resets, run visited all 11 properties in 2 ms. (steps per millisecond=178 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 9 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:35:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:15] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:35:15] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 17:35:15] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2021-05-17 17:35:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:35:15] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:15] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s4 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 24911 reset in 197 ms.
Product exploration explored 100000 steps with 25020 reset in 112 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25051 reset in 80 ms.
Product exploration explored 100000 steps with 25019 reset in 103 ms.
[2021-05-17 17:35:15] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:35:15] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:35:15] [INFO ] Time to serialize gal into /tmp/LTL11328411106060072728.gal : 0 ms
[2021-05-17 17:35:15] [INFO ] Time to serialize properties into /tmp/LTL7646476547964381962.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/LTL11328411106060072728.gal, -t, CGAL, -LTL, /tmp/LTL7646476547964381962.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/LTL11328411106060072728.gal -t CGAL -LTL /tmp/LTL7646476547964381962.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((InBath>=1)&&(Cabins>=1))")))
Formula 0 simplified : !F"((InBath>=1)&&(Cabins>=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
159 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,1.60617,38624,1,0,256,129606,20,52,532,136447,513
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-05-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property SwimmingPool-PT-05-00 finished in 2452 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:35:17] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:17] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:35:17] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:17] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2021-05-17 17:35:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2021-05-17 17:35:17] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-17 17:35:17] [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 23 ms :[(NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-02 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 15140 reset in 176 ms.
Product exploration explored 100000 steps with 15190 reset in 208 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15130 reset in 54 ms.
Product exploration explored 100000 steps with 15180 reset in 75 ms.
[2021-05-17 17:35:18] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:35:18] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:35:18] [INFO ] Time to serialize gal into /tmp/LTL8043187208709766096.gal : 1 ms
[2021-05-17 17:35:18] [INFO ] Time to serialize properties into /tmp/LTL11590463633842918567.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/LTL8043187208709766096.gal, -t, CGAL, -LTL, /tmp/LTL11590463633842918567.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/LTL8043187208709766096.gal -t CGAL -LTL /tmp/LTL11590463633842918567.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
324 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.25173,59532,1,0,880,182837,20,177,530,189309,1763
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-05-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SwimmingPool-PT-05-02 finished in 4023 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G((p1||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 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:35:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:35:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:21] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 17:35:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-17 17:35:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:21] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-05-05 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={0} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 3}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p0:(OR (LT s2 1) (LT s6 1) (LT s3 1)), p2:(GEQ s4 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-05-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-05 finished in 166 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 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 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:35:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:21] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:35:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-17 17:35:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:35:21] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:21] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-07 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:(GEQ s2 1), p0:(AND (GEQ s1 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 760 reset in 110 ms.
Stack based approach found an accepted trace after 284 steps with 5 reset with depth 267 and stack size 231 in 1 ms.
FORMULA SwimmingPool-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-07 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&X(!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.
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:35:21] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-17 17:35:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:22] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:22] [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.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true]
Running random walk in product with property : SwimmingPool-PT-05-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s7 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-05-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-08 finished in 130 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(F(p1))))))], workingDir=/home/mcc/execution]
Support contains 5 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:35:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:22] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:22] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-17 17:35:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:22] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/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-05-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s7 1) (OR (LT s1 1) (LT s8 1))), p1:(AND (GEQ s6 1) (OR (LT s1 1) (LT s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2151 reset in 131 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA SwimmingPool-PT-05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-09 finished in 236 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U 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.
Applied a total of 0 rules in 2 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:35:22] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:35:22] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:22] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:22] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:22] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 8814 reset in 68 ms.
Product exploration explored 100000 steps with 8750 reset in 123 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8920 reset in 88 ms.
Product exploration explored 100000 steps with 8745 reset in 116 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
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 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 17:35:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:35:23] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:35:23] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 6517 reset in 249 ms.
Product exploration explored 100000 steps with 5460 reset in 153 ms.
[2021-05-17 17:35:23] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:35:23] [INFO ] Flatten gal took : 2 ms
[2021-05-17 17:35:23] [INFO ] Time to serialize gal into /tmp/LTL12246876863234445792.gal : 1 ms
[2021-05-17 17:35:23] [INFO ] Time to serialize properties into /tmp/LTL13404018573404326598.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/LTL12246876863234445792.gal, -t, CGAL, -LTL, /tmp/LTL13404018573404326598.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/LTL12246876863234445792.gal -t CGAL -LTL /tmp/LTL13404018573404326598.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((InBath>=1)&&(Cabins>=1))")))U("((InBath>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !X(GF"((InBath>=1)&&(Cabins>=1))" U "((InBath>=1)&&(Cabins>=1))")
Detected timeout of ITS tools.
[2021-05-17 17:35:38] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:35:38] [INFO ] Applying decomposition
[2021-05-17 17:35:38] [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/graph6483357689139721024.txt, -o, /tmp/graph6483357689139721024.bin, -w, /tmp/graph6483357689139721024.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/graph6483357689139721024.bin, -l, -1, -v, -w, /tmp/graph6483357689139721024.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:35:38] [INFO ] Decomposing Gal with order
[2021-05-17 17:35:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:35:38] [INFO ] Flatten gal took : 47 ms
[2021-05-17 17:35:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 17:35:38] [INFO ] Time to serialize gal into /tmp/LTL5624739580514723067.gal : 0 ms
[2021-05-17 17:35:38] [INFO ] Time to serialize properties into /tmp/LTL4990095429539584438.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/LTL5624739580514723067.gal, -t, CGAL, -LTL, /tmp/LTL4990095429539584438.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/LTL5624739580514723067.gal -t CGAL -LTL /tmp/LTL4990095429539584438.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((u2.InBath>=1)&&(u1.Cabins>=1))")))U("((u2.InBath>=1)&&(u1.Cabins>=1))"))))
Formula 0 simplified : !X(GF"((u2.InBath>=1)&&(u1.Cabins>=1))" U "((u2.InBath>=1)&&(u1.Cabins>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12531592665118549587
[2021-05-17 17:35:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12531592665118549587
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/ltsmin12531592665118549587]
Compilation finished in 157 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12531592665118549587]
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))) U (LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin12531592665118549587]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-05-10 finished in 46417 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((G(!p0)&&X(F(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.
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:36:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:08] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:08] [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.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : SwimmingPool-PT-05-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(OR (LT s0 1) (LT s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 463 reset in 80 ms.
Stack based approach found an accepted trace after 84 steps with 1 reset with depth 44 and stack size 44 in 0 ms.
FORMULA SwimmingPool-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-11 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G((p0 U !p1))) U G((p2 U X(p3)))))], workingDir=/home/mcc/execution]
Support contains 6 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:36:08] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:08] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:08] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:36:09] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:09] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 321 ms :[(NOT p3), (AND p1 p2 (NOT p3)), (NOT p3), (AND p1 p2 (NOT p3)), (AND p1 (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3)) (AND p0 (NOT p3))), true, (OR (AND (NOT p1) (NOT p3)) (AND p0 (NOT p3))), p1, p1]
Running random walk in product with property : SwimmingPool-PT-05-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p2), acceptance={} source=0 dest: 4}, { cond=(NOT p2), acceptance={0} source=0 dest: 5}], [{ cond=(AND p2 (NOT p3) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={} source=1 dest: 7}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 5}], [{ cond=(AND p2 p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=3 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=4 dest: 10}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p0)), acceptance={} source=4 dest: 11}], [{ cond=(NOT p3), acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p3) p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) p0)), acceptance={} source=9 dest: 6}, { cond=(OR (AND p2 (NOT p1)) (AND p2 p0)), acceptance={} source=9 dest: 7}, { cond=(OR (NOT p1) p0), acceptance={} source=9 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND p1 p0), acceptance={0} source=10 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 8}, { cond=(AND p1 p0), acceptance={} source=11 dest: 10}, { cond=(OR (NOT p1) p0), acceptance={} source=11 dest: 11}]], initial=0, aps=[p2:(OR (GEQ s4 1) (GEQ s6 1)), p3:(AND (GEQ s0 1) (GEQ s7 1) (GEQ s1 1) (GEQ s8 1)), p1:(OR (LT s0 1) (LT s7 1)), p0:(AND (GEQ s1 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22699 reset in 98 ms.
Stack based approach found an accepted trace after 225 steps with 51 reset with depth 12 and stack size 12 in 0 ms.
FORMULA SwimmingPool-PT-05-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-12 finished in 473 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
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:36:09] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:09] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:36:09] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-17 17:36:09] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 17:36:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2021-05-17 17:36:09] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:36:09] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND p1 (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-05-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s5 1)), p0:(AND (GEQ s2 1) (GEQ s5 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 15144 reset in 75 ms.
Product exploration explored 100000 steps with 15045 reset in 82 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 19 ms :[(AND p1 (NOT p0))]
Product exploration explored 100000 steps with 15094 reset in 76 ms.
Product exploration explored 100000 steps with 14989 reset in 83 ms.
[2021-05-17 17:36:09] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:36:09] [INFO ] Flatten gal took : 0 ms
[2021-05-17 17:36:09] [INFO ] Time to serialize gal into /tmp/LTL8858195951194463546.gal : 0 ms
[2021-05-17 17:36:09] [INFO ] Time to serialize properties into /tmp/LTL16730481739744563029.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/LTL8858195951194463546.gal, -t, CGAL, -LTL, /tmp/LTL16730481739744563029.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/LTL8858195951194463546.gal -t CGAL -LTL /tmp/LTL16730481739744563029.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G("((Entered>=1)&&(Cabins>=1))"))||("((InBath>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !F("((InBath>=1)&&(Cabins>=1))" | G"((Entered>=1)&&(Cabins>=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
326 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.27201,60632,1,0,1252,209015,28,353,656,216453,2516
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA SwimmingPool-PT-05-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property SwimmingPool-PT-05-13 finished in 3871 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(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.
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:36:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:36:13] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:13] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-17 17:36:13] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:13] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:13] [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.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s8 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 25009 reset in 51 ms.
Product exploration explored 100000 steps with 24960 reset in 61 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 24911 reset in 51 ms.
Product exploration explored 100000 steps with 25025 reset in 60 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
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 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 9 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2021-05-17 17:36:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:13] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 17:36:13] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Product exploration explored 100000 steps with 33333 reset in 103 ms.
[2021-05-17 17:36:14] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:36:14] [INFO ] Flatten gal took : 0 ms
[2021-05-17 17:36:14] [INFO ] Time to serialize gal into /tmp/LTL4614385963315775659.gal : 0 ms
[2021-05-17 17:36:14] [INFO ] Time to serialize properties into /tmp/LTL11926780756049641007.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/LTL4614385963315775659.gal, -t, CGAL, -LTL, /tmp/LTL11926780756049641007.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/LTL4614385963315775659.gal -t CGAL -LTL /tmp/LTL11926780756049641007.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((WaitBag>=1)&&(Bags>=1))"))))
Formula 0 simplified : !XF"((WaitBag>=1)&&(Bags>=1))"
Detected timeout of ITS tools.
[2021-05-17 17:36:29] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:36:29] [INFO ] Applying decomposition
[2021-05-17 17:36:29] [INFO ] Flatten gal took : 0 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/graph17953637663102165824.txt, -o, /tmp/graph17953637663102165824.bin, -w, /tmp/graph17953637663102165824.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/graph17953637663102165824.bin, -l, -1, -v, -w, /tmp/graph17953637663102165824.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:36:29] [INFO ] Decomposing Gal with order
[2021-05-17 17:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:36:29] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:36:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:36:29] [INFO ] Time to serialize gal into /tmp/LTL11169595788614412126.gal : 1 ms
[2021-05-17 17:36:29] [INFO ] Time to serialize properties into /tmp/LTL10214657510153003665.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/LTL11169595788614412126.gal, -t, CGAL, -LTL, /tmp/LTL10214657510153003665.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/LTL11169595788614412126.gal -t CGAL -LTL /tmp/LTL10214657510153003665.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((u0.WaitBag>=1)&&(u1.Bags>=1))"))))
Formula 0 simplified : !XF"((u0.WaitBag>=1)&&(u1.Bags>=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1980816821332144754
[2021-05-17 17:36:44] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1980816821332144754
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/ltsmin1980816821332144754]
Compilation finished in 92 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1980816821332144754]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>((LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin1980816821332144754]
LTSmin run took 302 ms.
FORMULA SwimmingPool-PT-05-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-05-14 finished in 31168 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(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:36:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:44] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2021-05-17 17:36:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:44] [INFO ] Implicit Places using invariants and state equation in 10 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:36:44] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 17:36:44] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-05-15 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA SwimmingPool-PT-05-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SwimmingPool-PT-05-15 finished in 118 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16593539011893932646
[2021-05-17 17:36:44] [INFO ] Applying decomposition
[2021-05-17 17:36:44] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:36:44] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2021-05-17 17:36:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:36:44] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2021-05-17 17:36:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:36:44] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2021-05-17 17:36:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-17 17:36:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16593539011893932646
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/ltsmin16593539011893932646]
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/graph15509256949444589781.txt, -o, /tmp/graph15509256949444589781.bin, -w, /tmp/graph15509256949444589781.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/graph15509256949444589781.bin, -l, -1, -v, -w, /tmp/graph15509256949444589781.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:36:44] [INFO ] Decomposing Gal with order
[2021-05-17 17:36:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:36:44] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:36:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-17 17:36:44] [INFO ] Time to serialize gal into /tmp/LTLFireability1880812357222016869.gal : 0 ms
[2021-05-17 17:36:44] [INFO ] Time to serialize properties into /tmp/LTLFireability15460869373290538471.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/LTLFireability1880812357222016869.gal, -t, CGAL, -LTL, /tmp/LTLFireability15460869373290538471.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/LTLFireability1880812357222016869.gal -t CGAL -LTL /tmp/LTLFireability15460869373290538471.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((u2.InBath>=1)&&(u1.Cabins>=1))")))U("((u2.InBath>=1)&&(u1.Cabins>=1))"))))
Formula 0 simplified : !X(GF"((u2.InBath>=1)&&(u1.Cabins>=1))" U "((u2.InBath>=1)&&(u1.Cabins>=1))")
Compilation finished in 119 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin16593539011893932646]
Link finished in 30 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true))) U (LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16593539011893932646]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: LTL layer: formula: X(([](<>((LTLAPp0==true))) U (LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.006: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: "X(([](<>((LTLAPp0==true))) U (LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.012: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.061: DFS-FIFO for weak LTL, using special progress label 9
pins2lts-mc-linux64( 0/ 8), 0.061: There are 10 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.061: State length is 10, there are 13 groups
pins2lts-mc-linux64( 0/ 8), 0.061: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.061: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.061: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.061: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.145: ~98 levels ~960 states ~5848 transitions
pins2lts-mc-linux64( 4/ 8), 0.146: ~188 levels ~1920 states ~10552 transitions
pins2lts-mc-linux64( 4/ 8), 0.147: ~202 levels ~3840 states ~17464 transitions
pins2lts-mc-linux64( 4/ 8), 0.148: ~202 levels ~7680 states ~32552 transitions
pins2lts-mc-linux64( 5/ 8), 0.150: ~201 levels ~15360 states ~60536 transitions
pins2lts-mc-linux64( 1/ 8), 0.159: ~192 levels ~30720 states ~124760 transitions
pins2lts-mc-linux64( 1/ 8), 0.181: ~192 levels ~61440 states ~273816 transitions
pins2lts-mc-linux64( 1/ 8), 0.224: ~192 levels ~122880 states ~593048 transitions
pins2lts-mc-linux64( 3/ 8), 0.316: ~192 levels ~245760 states ~1278056 transitions
pins2lts-mc-linux64( 7/ 8), 0.419: ~184 levels ~491520 states ~2378184 transitions
pins2lts-mc-linux64( 7/ 8), 0.518: ~184 levels ~983040 states ~3668744 transitions
pins2lts-mc-linux64( 7/ 8), 1.332: ~184 levels ~1966080 states ~8683040 transitions
pins2lts-mc-linux64( 0/ 8), 2.839: ~198 levels ~3932160 states ~16959776 transitions
pins2lts-mc-linux64( 0/ 8), 5.708: ~198 levels ~7864320 states ~36113216 transitions
pins2lts-mc-linux64( 2/ 8), 11.518: ~201 levels ~15728640 states ~71354912 transitions
pins2lts-mc-linux64( 2/ 8), 24.680: ~201 levels ~31457280 states ~148610248 transitions
pins2lts-mc-linux64( 2/ 8), 52.595: ~201 levels ~62914560 states ~312941744 transitions
pins2lts-mc-linux64( 6/ 8), 112.374: ~192 levels ~125829120 states ~658115328 transitions
pins2lts-mc-linux64( 6/ 8), 144.132: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 144.150:
pins2lts-mc-linux64( 0/ 8), 144.150: mean standard work distribution: 7.0% (states) 3.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 144.150:
pins2lts-mc-linux64( 0/ 8), 144.150: Explored 132820173 states 800443360 transitions, fanout: 6.027
pins2lts-mc-linux64( 0/ 8), 144.150: Total exploration time 144.090 sec (144.040 sec minimum, 144.068 sec on average)
pins2lts-mc-linux64( 0/ 8), 144.150: States per second: 921786, Transitions per second: 5555163
pins2lts-mc-linux64( 0/ 8), 144.150:
pins2lts-mc-linux64( 0/ 8), 144.150: Progress states detected: 106837271
pins2lts-mc-linux64( 0/ 8), 144.150: Redundant explorations: -1.0409
pins2lts-mc-linux64( 0/ 8), 144.150:
pins2lts-mc-linux64( 0/ 8), 144.150: Queue width: 8B, total height: 10446615, memory: 79.70MB
pins2lts-mc-linux64( 0/ 8), 144.150: Tree memory: 1184.2MB, 9.3 B/state, compr.: 22.0%
pins2lts-mc-linux64( 0/ 8), 144.150: Tree fill ratio (roots/leafs): 99.0%/62.0%
pins2lts-mc-linux64( 0/ 8), 144.150: Stored 7 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 144.150: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 144.150: Est. total memory use: 1263.9MB (~1103.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true))) U (LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16593539011893932646]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(([](<>((LTLAPp0==true))) U (LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin16593539011893932646]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:98)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-17 17:57:13] [INFO ] Flatten gal took : 1 ms
[2021-05-17 17:57:13] [INFO ] Time to serialize gal into /tmp/LTLFireability17540831148494333974.gal : 1 ms
[2021-05-17 17:57:13] [INFO ] Time to serialize properties into /tmp/LTLFireability7384594031480310398.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/LTLFireability17540831148494333974.gal, -t, CGAL, -LTL, /tmp/LTLFireability7384594031480310398.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/LTLFireability17540831148494333974.gal -t CGAL -LTL /tmp/LTLFireability7384594031480310398.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G(F("((InBath>=1)&&(Cabins>=1))")))U("((InBath>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !X(GF"((InBath>=1)&&(Cabins>=1))" U "((InBath>=1)&&(Cabins>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2021-05-17 18:17:42] [INFO ] Flatten gal took : 1 ms
[2021-05-17 18:17:42] [INFO ] Input system was already deterministic with 7 transitions.
[2021-05-17 18:17:42] [INFO ] Transformed 9 places.
[2021-05-17 18:17:42] [INFO ] Transformed 7 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-17 18:17:42] [INFO ] Time to serialize gal into /tmp/LTLFireability6280537045148199799.gal : 0 ms
[2021-05-17 18:17:42] [INFO ] Time to serialize properties into /tmp/LTLFireability6948125398943811713.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/LTLFireability6280537045148199799.gal, -t, CGAL, -LTL, /tmp/LTLFireability6948125398943811713.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability6280537045148199799.gal -t CGAL -LTL /tmp/LTLFireability6948125398943811713.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((G(F("((InBath>=1)&&(Cabins>=1))")))U("((InBath>=1)&&(Cabins>=1))"))))
Formula 0 simplified : !X(GF"((InBath>=1)&&(Cabins>=1))" U "((InBath>=1)&&(Cabins>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SwimmingPool-PT-05"
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-05, 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-162106746400749"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-05.tgz
mv SwimmingPool-PT-05 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 '
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 ;