About the Execution of 2023-gold for SwimmingPool-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10575.739 | 3600000.00 | 4864893.00 | 9950.20 | TTT?FTFTFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556500468.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SwimmingPool-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556500468
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 19:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 19:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 19:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.9K May 18 16:43 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-03-LTLFireability-00
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-01
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-02
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-03
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-04
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-05
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-06
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-07
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-08
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-09
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-10
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-11
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-12
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-13
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-14
FORMULA_NAME SwimmingPool-PT-03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717161968775
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-03
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-31 13:26:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 13:26:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 13:26:10] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2024-05-31 13:26:10] [INFO ] Transformed 9 places.
[2024-05-31 13:26:10] [INFO ] Transformed 7 transitions.
[2024-05-31 13:26:10] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA SwimmingPool-PT-03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SwimmingPool-PT-03-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 9 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2024-05-31 13:26:10] [INFO ] Computed 3 invariants in 8 ms
[2024-05-31 13:26:10] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-31 13:26:10] [INFO ] Invariant cache hit.
[2024-05-31 13:26:10] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-31 13:26:10] [INFO ] Invariant cache hit.
[2024-05-31 13:26:10] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 7 out of 9 places after structural reductions.
[2024-05-31 13:26:11] [INFO ] Flatten gal took : 13 ms
[2024-05-31 13:26:11] [INFO ] Flatten gal took : 2 ms
[2024-05-31 13:26:11] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 186 steps, including 0 resets, run visited all 10 properties in 8 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 1 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2024-05-31 13:26:11] [INFO ] Invariant cache hit.
[2024-05-31 13:26:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 13:26:11] [INFO ] Invariant cache hit.
[2024-05-31 13:26:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-31 13:26:11] [INFO ] Invariant cache hit.
[2024-05-31 13:26:11] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 9/9 places, 7/7 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s7 1)), p0:(OR (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Product exploration explored 100000 steps with 50000 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-03-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-03-LTLFireability-00 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2024-05-31 13:26:12] [INFO ] Invariant cache hit.
[2024-05-31 13:26:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 13:26:12] [INFO ] Invariant cache hit.
[2024-05-31 13:26:12] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-31 13:26:12] [INFO ] Invariant cache hit.
[2024-05-31 13:26:12] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 142 ms.
Product exploration explored 100000 steps with 33333 reset in 129 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SwimmingPool-PT-03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SwimmingPool-PT-03-LTLFireability-02 finished in 493 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1||F(p2))))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 4 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-31 13:26:12] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 13:26:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-31 13:26:12] [INFO ] Invariant cache hit.
[2024-05-31 13:26:12] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-31 13:26:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:26:12] [INFO ] Invariant cache hit.
[2024-05-31 13:26:12] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 149 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 442 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s5 1) (AND (GEQ s0 1) (GEQ s6 1))), p1:(AND (GEQ s0 1) (GEQ s6 1)), p2:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 503 reset in 154 ms.
Product exploration explored 100000 steps with 721 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), true, (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))))]
Knowledge based reduction with 8 factoid took 409 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 13:26:14] [INFO ] Invariant cache hit.
[2024-05-31 13:26:14] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p0 p1 (NOT p2))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), true, (X (X p0)), (G (NOT (AND p1 (NOT p0) p2)))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))))), (F (AND p1 p0 p2)), (F (AND p1 p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p0) p2)), (F (AND (NOT p1) p0 p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 9 factoid took 2183 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 530 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 367 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
[2024-05-31 13:26:17] [INFO ] Invariant cache hit.
[2024-05-31 13:26:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 13:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 13:26:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-31 13:26:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 13:26:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 13:26:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 13:26:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-31 13:26:17] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-31 13:26:17] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-31 13:26:17] [INFO ] Invariant cache hit.
[2024-05-31 13:26:17] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 13:26:17] [INFO ] Invariant cache hit.
[2024-05-31 13:26:17] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-31 13:26:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:26:17] [INFO ] Invariant cache hit.
[2024-05-31 13:26:17] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 13 factoid took 473 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 363 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
Incomplete random walk after 10013 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=770 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 13:26:18] [INFO ] Invariant cache hit.
[2024-05-31 13:26:18] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (AND p1 p0 (NOT p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), true, (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND p0 p1 p2)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 14 factoid took 726 ms. Reduced automaton from 9 states, 23 edges and 3 AP (stutter insensitive) to 9 states, 23 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 347 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
Stuttering acceptance computed with spot in 369 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
[2024-05-31 13:26:19] [INFO ] Invariant cache hit.
[2024-05-31 13:26:19] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 13:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 13:26:19] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-31 13:26:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 13:26:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-31 13:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 13:26:19] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-31 13:26:19] [INFO ] Computed and/alt/rep : 5/5/5 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 13:26:19] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 378 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false, false, false, false]
Product exploration explored 100000 steps with 663 reset in 78 ms.
Product exploration explored 100000 steps with 524 reset in 200 ms.
Built C files in :
/tmp/ltsmin2833400324956744961
[2024-05-31 13:26:20] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-31 13:26:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:26:20] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-31 13:26:20] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:26:20] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-31 13:26:20] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:26:20] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2833400324956744961
Running compilation step : cd /tmp/ltsmin2833400324956744961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 167 ms.
Running link step : cd /tmp/ltsmin2833400324956744961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin2833400324956744961;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2613653084765301940.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-31 13:26:35] [INFO ] Invariant cache hit.
[2024-05-31 13:26:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 13:26:35] [INFO ] Invariant cache hit.
[2024-05-31 13:26:35] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-31 13:26:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:26:35] [INFO ] Invariant cache hit.
[2024-05-31 13:26:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 8/8 places, 6/6 transitions.
Built C files in :
/tmp/ltsmin6220109422397872260
[2024-05-31 13:26:35] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-31 13:26:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:26:35] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-31 13:26:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:26:35] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-31 13:26:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:26:35] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6220109422397872260
Running compilation step : cd /tmp/ltsmin6220109422397872260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 73 ms.
Running link step : cd /tmp/ltsmin6220109422397872260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin6220109422397872260;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3251899239057574443.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-31 13:26:51] [INFO ] Flatten gal took : 2 ms
[2024-05-31 13:26:51] [INFO ] Flatten gal took : 1 ms
[2024-05-31 13:26:51] [INFO ] Time to serialize gal into /tmp/LTL8362112091771806077.gal : 2 ms
[2024-05-31 13:26:51] [INFO ] Time to serialize properties into /tmp/LTL10230539668912010544.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8362112091771806077.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5222405606812317943.hoa' '-atoms' '/tmp/LTL10230539668912010544.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10230539668912010544.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5222405606812317943.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 13:27:06] [INFO ] Flatten gal took : 2 ms
[2024-05-31 13:27:06] [INFO ] Flatten gal took : 1 ms
[2024-05-31 13:27:06] [INFO ] Time to serialize gal into /tmp/LTL16511030243822074225.gal : 1 ms
[2024-05-31 13:27:06] [INFO ] Time to serialize properties into /tmp/LTL10269239353918510139.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16511030243822074225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10269239353918510139.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(("((Entered>=1)&&(Cabins>=1))")||(F("(Dressed>=1)"))))&&("((Out>=1)||((Entered>=1)&&(Cabins>=1)))"))))
Formula 0 simplified : G(!"((Out>=1)||((Entered>=1)&&(Cabins>=1)))" | F(!"((Entered>=1)&&(Cabins>=1))" & G!"(Dressed>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 13:27:21] [INFO ] Flatten gal took : 2 ms
[2024-05-31 13:27:21] [INFO ] Applying decomposition
[2024-05-31 13:27:21] [INFO ] Flatten gal took : 1 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7019092474457512347.txt' '-o' '/tmp/graph7019092474457512347.bin' '-w' '/tmp/graph7019092474457512347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7019092474457512347.bin' '-l' '-1' '-v' '-w' '/tmp/graph7019092474457512347.weights' '-q' '0' '-e' '0.001'
[2024-05-31 13:27:21] [INFO ] Decomposing Gal with order
[2024-05-31 13:27:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 13:27:21] [INFO ] Flatten gal took : 29 ms
[2024-05-31 13:27:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-31 13:27:21] [INFO ] Time to serialize gal into /tmp/LTL8482535032217818173.gal : 1 ms
[2024-05-31 13:27:21] [INFO ] Time to serialize properties into /tmp/LTL16196380032355988635.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8482535032217818173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16196380032355988635.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(("((u1.Entered>=1)&&(u2.Cabins>=1))")||(F("(u1.Dressed>=1)"))))&&("((u1.Out>=1)||((u1.Entered>=1)&&(u2.Cabins>=1)))"))))
Formula 0 simplified : G(!"((u1.Out>=1)||((u1.Entered>=1)&&(u2.Cabins>=1)))" | F(!"((u1.Entered>=1)&&(u2.Cabins>=1))" & G!"(u1.Dressed>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin532736458551076044
[2024-05-31 13:27:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin532736458551076044
Running compilation step : cd /tmp/ltsmin532736458551076044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 64 ms.
Running link step : cd /tmp/ltsmin532736458551076044;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin532736458551076044;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](((LTLAPp0==true)||<>((LTLAPp1==true))))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property SwimmingPool-PT-03-LTLFireability-03 finished in 98933 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 7 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 7 cols
[2024-05-31 13:27:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:27:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 13:27:51] [INFO ] Invariant cache hit.
[2024-05-31 13:27:51] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-31 13:27:51] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:27:51] [INFO ] Invariant cache hit.
[2024-05-31 13:27:51] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/9 places, 5/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 7/9 places, 5/7 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50 reset in 71 ms.
Product exploration explored 100000 steps with 54 reset in 101 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 1440 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 7 /7 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2024-05-31 13:27:53] [INFO ] Invariant cache hit.
[2024-05-31 13:27:53] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 13:27:53] [INFO ] Invariant cache hit.
[2024-05-31 13:27:53] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-31 13:27:53] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:27:53] [INFO ] Invariant cache hit.
[2024-05-31 13:27:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 7/7 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 61 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 57 reset in 70 ms.
Product exploration explored 100000 steps with 58 reset in 78 ms.
Built C files in :
/tmp/ltsmin5326370485650588887
[2024-05-31 13:27:54] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2024-05-31 13:27:54] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:27:54] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2024-05-31 13:27:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:27:54] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2024-05-31 13:27:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:27:54] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5326370485650588887
Running compilation step : cd /tmp/ltsmin5326370485650588887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 78 ms.
Running link step : cd /tmp/ltsmin5326370485650588887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5326370485650588887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11021113088418099524.hoa' '--buchi-type=spotba'
LTSmin run took 2802 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-LTLFireability-07 finished in 5855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1||X(G(p2)))&&p0))))'
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
// Phase 1: matrix 6 rows 8 cols
[2024-05-31 13:27:57] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:27:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 13:27:57] [INFO ] Invariant cache hit.
[2024-05-31 13:27:57] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-31 13:27:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:27:57] [INFO ] Invariant cache hit.
[2024-05-31 13:27:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s2 1), p0:(AND (LT s5 1) (OR (LT s3 1) (LT s6 1))), p2:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 85 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 1 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-09 finished in 270 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||F(p1)))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Applied a total of 2 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 6/7 (removed 1) transitions.
[2024-05-31 13:27:57] [INFO ] Invariant cache hit.
[2024-05-31 13:27:57] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 13:27:57] [INFO ] Invariant cache hit.
[2024-05-31 13:27:57] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-31 13:27:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:27:57] [INFO ] Invariant cache hit.
[2024-05-31 13:27:57] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/9 places, 6/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 8/9 places, 6/7 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s2 1), p0:(AND (GEQ s0 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 15180 reset in 53 ms.
Product exploration explored 100000 steps with 15091 reset in 62 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p1)), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 308 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-31 13:27:58] [INFO ] Invariant cache hit.
[2024-05-31 13:27:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 13:27:58] [INFO ] Invariant cache hit.
[2024-05-31 13:27:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-31 13:27:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:27:58] [INFO ] Invariant cache hit.
[2024-05-31 13:27:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 209 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Finished random walk after 124 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=62 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND p0 p1)), (F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 253 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Product exploration explored 100000 steps with 15078 reset in 60 ms.
Product exploration explored 100000 steps with 15046 reset in 71 ms.
Built C files in :
/tmp/ltsmin3436279545612184527
[2024-05-31 13:27:59] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-31 13:27:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:27:59] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-31 13:27:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:27:59] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-31 13:27:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:27:59] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3436279545612184527
Running compilation step : cd /tmp/ltsmin3436279545612184527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 75 ms.
Running link step : cd /tmp/ltsmin3436279545612184527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin3436279545612184527;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6570061653920969442.hoa' '--buchi-type=spotba'
LTSmin run took 240 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-LTLFireability-10 finished in 2761 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(!p0)))'
Support contains 1 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 4
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-31 13:28:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:28:00] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-31 13:28:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/9 places, 4/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 70 ms. Remains : 6/9 places, 4/7 transitions.
Stuttering acceptance computed with spot in 75 ms :[false, (NOT p0)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 88 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-11 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 3 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
[2024-05-31 13:28:00] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 13:28:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s0 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Stack based approach found an accepted trace after 913 steps with 0 reset with depth 914 and stack size 906 in 1 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SwimmingPool-PT-03-LTLFireability-13 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||X((p1&&X(p2))))))'
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-31 13:28:00] [INFO ] Invariant cache hit.
[2024-05-31 13:28:00] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 9/9 places, 7/7 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : SwimmingPool-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(LT s4 1), p1:(OR (GEQ s4 1) (GEQ s6 1)), p2:(OR (GEQ s6 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24927 reset in 51 ms.
Product exploration explored 100000 steps with 24823 reset in 56 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Finished random walk after 155 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=155 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p1), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2024-05-31 13:28:01] [INFO ] Invariant cache hit.
[2024-05-31 13:28:01] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 13:28:01] [INFO ] Invariant cache hit.
[2024-05-31 13:28:01] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-31 13:28:01] [INFO ] Invariant cache hit.
[2024-05-31 13:28:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73 ms. Remains : 9/9 places, 7/7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1211 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Finished random walk after 155 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=77 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X p1), true, (X (X p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 135 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 24973 reset in 50 ms.
Product exploration explored 100000 steps with 24964 reset in 50 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 2 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, 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
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-05-31 13:28:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 7 rows 9 cols
[2024-05-31 13:28:04] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 13:28:04] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/9 places, 7/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30 ms. Remains : 9/9 places, 7/7 transitions.
Built C files in :
/tmp/ltsmin12602353425240419971
[2024-05-31 13:28:04] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12602353425240419971
Running compilation step : cd /tmp/ltsmin12602353425240419971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 62 ms.
Running link step : cd /tmp/ltsmin12602353425240419971;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12602353425240419971;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased87860826567910069.hoa' '--buchi-type=spotba'
LTSmin run took 5145 ms.
FORMULA SwimmingPool-PT-03-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SwimmingPool-PT-03-LTLFireability-14 finished in 8652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1||F(p2))))))'
[2024-05-31 13:28:09] [INFO ] Flatten gal took : 3 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11042655780462728648
[2024-05-31 13:28:09] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2024-05-31 13:28:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:28:09] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2024-05-31 13:28:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:28:09] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2024-05-31 13:28:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-31 13:28:09] [INFO ] Applying decomposition
[2024-05-31 13:28:09] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11042655780462728648
Running compilation step : cd /tmp/ltsmin11042655780462728648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-31 13:28:09] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph94426769201970890.txt' '-o' '/tmp/graph94426769201970890.bin' '-w' '/tmp/graph94426769201970890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph94426769201970890.bin' '-l' '-1' '-v' '-w' '/tmp/graph94426769201970890.weights' '-q' '0' '-e' '0.001'
[2024-05-31 13:28:09] [INFO ] Decomposing Gal with order
[2024-05-31 13:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 13:28:09] [INFO ] Flatten gal took : 2 ms
[2024-05-31 13:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-31 13:28:09] [INFO ] Time to serialize gal into /tmp/LTLFireability11473709650201342065.gal : 28 ms
[2024-05-31 13:28:09] [INFO ] Time to serialize properties into /tmp/LTLFireability17751425934441339453.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11473709650201342065.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17751425934441339453.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(("((u0.Out>=1)||((u0.Entered>=1)&&(u2.Cabins>=1)))")&&(G(("((u0.Entered>=1)&&(u2.Cabins>=1))")||(F("(u2.Dressed>=1)")))))))
Formula 0 simplified : G(!"((u0.Out>=1)||((u0.Entered>=1)&&(u2.Cabins>=1)))" | F(!"((u0.Entered>=1)&&(u2.Cabins>=1))" & G!"(u2.Dressed>=1)"))
Compilation finished in 68 ms.
Running link step : cd /tmp/ltsmin11042655780462728648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin11042655780462728648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 10, guards 7
pins2lts-mc-linux64( 4/ 8), 0.001: LTL layer: formula: <>(((LTLAPp0==true)&&[](((LTLAPp1==true)||<>((LTLAPp2==true))))))
pins2lts-mc-linux64( 4/ 8), 0.001: "<>(((LTLAPp0==true)&&[](((LTLAPp1==true)||<>((LTLAPp2==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.018: There are 11 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.018: State length is 10, there are 17 groups
pins2lts-mc-linux64( 0/ 8), 0.018: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.018: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.018: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.018: Visible groups: 0 / 17, labels: 3 / 11
pins2lts-mc-linux64( 0/ 8), 0.018: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.018: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.036: [Blue] ~102 levels ~960 states ~1960 transitions
pins2lts-mc-linux64( 2/ 8), 0.056: [Blue] ~240 levels ~1920 states ~5192 transitions
pins2lts-mc-linux64( 2/ 8), 0.072: [Blue] ~480 levels ~3840 states ~10200 transitions
pins2lts-mc-linux64( 2/ 8), 0.098: [Blue] ~939 levels ~7680 states ~22808 transitions
pins2lts-mc-linux64( 2/ 8), 0.166: [Blue] ~1795 levels ~15360 states ~48008 transitions
pins2lts-mc-linux64( 2/ 8), 0.314: [Blue] ~3610 levels ~30720 states ~101480 transitions
pins2lts-mc-linux64( 7/ 8), 0.472: [Blue] ~472 levels ~61440 states ~128976 transitions
pins2lts-mc-linux64( 0/ 8), 0.770: [Blue] ~234 levels ~122880 states ~272216 transitions
pins2lts-mc-linux64( 7/ 8), 1.351: [Blue] ~472 levels ~245760 states ~547576 transitions
pins2lts-mc-linux64( 0/ 8), 3.960: [Blue] ~234 levels ~491520 states ~1131304 transitions
pins2lts-mc-linux64( 3/ 8), 6.717: [Blue] ~227 levels ~983040 states ~2124472 transitions
pins2lts-mc-linux64( 0/ 8), 11.364: [Blue] ~234 levels ~1966080 states ~4432288 transitions
pins2lts-mc-linux64( 3/ 8), 17.587: [Blue] ~136734 levels ~3932160 states ~8051392 transitions
pins2lts-mc-linux64( 0/ 8), 27.437: [Blue] ~644386 levels ~7864320 states ~19392304 transitions
pins2lts-mc-linux64( 0/ 8), 47.101: [Blue] ~1590715 levels ~15728640 states ~36593392 transitions
pins2lts-mc-linux64( 0/ 8), 90.880: [Blue] ~3487966 levels ~31457280 states ~68188240 transitions
pins2lts-mc-linux64( 0/ 8), 181.217: [Blue] ~7307417 levels ~62914560 states ~125683000 transitions
pins2lts-mc-linux64( 0/ 8), 328.887: [Blue] ~14919474 levels ~125829120 states ~227264552 transitions
pins2lts-mc-linux64( 0/ 8), 344.735, file cndfs.c, line 199: assertion "onstack != FSET_FULL" failed
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(HREprintStack+0x34) [0x55c21ba27b14]
1: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(+0x1bcbb6) [0x55c21ba27bb6]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f03e084e140]
3: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(_ZSt28_Rb_tree_rebalance_for_erasePSt18_Rb_tree_node_baseRS_+0x1c2) [0x55c21bd88cf2]
4: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(_ZNK4spot5fnode11destroy_auxEv+0x443) [0x55c21baea1f3]
5: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(_ZN4spot3twaD1Ev+0x36a) [0x55c21bbf852a]
6: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(_ZNSt10shared_ptrIN4spot9twa_graphEED1Ev+0x50) [0x55c21ba3b910]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f03e069f4d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f03e069f67a]
9: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(+0x1bbca1) [0x55c21ba26ca1]
10: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(HREsetExit+0) [0x55c21ba27030]
11: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(HREabort+0x22) [0x55c21ba289c2]
12: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(+0x185614) [0x55c21b9f0614]
13: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(permute_trans+0x2c0) [0x55c21b9ec580]
14: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(endfs_blue+0x91f) [0x55c21b9f1c5f]
15: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(alg_run+0x36) [0x55c21b9efd96]
16: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(run_alg+0x1d) [0x55c21b9ed17d]
17: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(main+0x101) [0x55c21b9e7a01]
18: /home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64(+0x1bf32a) [0x55c21ba2a32a]
19: /lib/x86_64-linux-gnu/libpthread.so.0(+0x7ea7) [0x7f03e0842ea7]
20: /lib/x86_64-linux-gnu/libc.so.6(clone+0x3f) [0x7f03e0760a2f]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11042655780462728648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11042655780462728648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)&&[](((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-31 13:48:48] [INFO ] Flatten gal took : 1 ms
[2024-05-31 13:48:48] [INFO ] Time to serialize gal into /tmp/LTLFireability12467630529472390448.gal : 1 ms
[2024-05-31 13:48:48] [INFO ] Time to serialize properties into /tmp/LTLFireability13338284783229413819.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12467630529472390448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13338284783229413819.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((F(("((Out>=1)||((Entered>=1)&&(Cabins>=1)))")&&(G(("((Entered>=1)&&(Cabins>=1))")||(F("(Dressed>=1)")))))))
Formula 0 simplified : G(!"((Out>=1)||((Entered>=1)&&(Cabins>=1)))" | F(!"((Entered>=1)&&(Cabins>=1))" & G!"(Dressed>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-31 14:09:27] [INFO ] Flatten gal took : 1 ms
[2024-05-31 14:09:27] [INFO ] Input system was already deterministic with 7 transitions.
[2024-05-31 14:09:27] [INFO ] Transformed 9 places.
[2024-05-31 14:09:27] [INFO ] Transformed 7 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-31 14:09:27] [INFO ] Time to serialize gal into /tmp/LTLFireability1793153815261210049.gal : 3 ms
[2024-05-31 14:09:27] [INFO ] Time to serialize properties into /tmp/LTLFireability17868584450073034169.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1793153815261210049.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17868584450073034169.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((Out>=1)||((Entered>=1)&&(Cabins>=1)))")&&(G(("((Entered>=1)&&(Cabins>=1))")||(F("(Dressed>=1)")))))))
Formula 0 simplified : G(!"((Out>=1)||((Entered>=1)&&(Cabins>=1)))" | F(!"((Entered>=1)&&(Cabins>=1))" & G!"(Dressed>=1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12053152 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16043352 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SwimmingPool-PT-03, 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 r417-tall-171690556500468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-03.tgz
mv SwimmingPool-PT-03 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 ;