About the Execution of 2023-gold for ShieldIIPs-PT-004A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.380 | 3600000.00 | 8920432.00 | 116526.90 | FFFFFFFFT??FFFFT | 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.r373-tall-171683788300033.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 ShieldIIPs-PT-004A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788300033
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 34K 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 ShieldIIPs-PT-004A-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-004A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716927604261
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=ShieldIIPs-PT-004A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 20:20:06] [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-28 20:20:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:20:06] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2024-05-28 20:20:06] [INFO ] Transformed 103 places.
[2024-05-28 20:20:06] [INFO ] Transformed 99 transitions.
[2024-05-28 20:20:06] [INFO ] Found NUPN structural information;
[2024-05-28 20:20:06] [INFO ] Parsed PT model containing 103 places and 99 transitions and 438 arcs in 121 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 1 formulas.
FORMULA ShieldIIPs-PT-004A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 12 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:20:06] [INFO ] Computed 37 invariants in 14 ms
[2024-05-28 20:20:06] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-28 20:20:06] [INFO ] Invariant cache hit.
[2024-05-28 20:20:07] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-05-28 20:20:07] [INFO ] Invariant cache hit.
[2024-05-28 20:20:07] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 549 ms. Remains : 103/103 places, 99/99 transitions.
Support contains 46 out of 103 places after structural reductions.
[2024-05-28 20:20:07] [INFO ] Flatten gal took : 40 ms
[2024-05-28 20:20:07] [INFO ] Flatten gal took : 14 ms
[2024-05-28 20:20:07] [INFO ] Input system was already deterministic with 99 transitions.
Finished random walk after 1824 steps, including 7 resets, run visited all 27 properties in 199 ms. (steps per millisecond=9 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 1 stabilizing places and 1 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' '!((!p0 U G((p1 U p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 19 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 20:20:08] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 20:20:08] [INFO ] Implicit Places using invariants in 88 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 100/103 places, 97/99 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 335 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s97 1), p0:(AND (EQ s38 1) (EQ s48 1) (EQ s50 1)), p1:(EQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 228 steps with 1 reset in 9 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-00 finished in 542 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 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Reduce places removed 1 places and 1 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 102 transition count 97
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
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 0 with 2 rules applied. Total rules applied 5 place count 99 transition count 96
Applied a total of 5 rules in 11 ms. Remains 99 /103 variables (removed 4) and now considering 96/99 (removed 3) transitions.
// Phase 1: matrix 96 rows 99 cols
[2024-05-28 20:20:08] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 20:20:08] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-28 20:20:08] [INFO ] Invariant cache hit.
[2024-05-28 20:20:08] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-28 20:20:08] [INFO ] Redundant transitions in 22 ms returned [90]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 95 rows 99 cols
[2024-05-28 20:20:08] [INFO ] Computed 36 invariants in 4 ms
[2024-05-28 20:20:08] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/103 places, 95/99 transitions.
Applied a total of 0 rules in 11 ms. Remains 99 /99 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 99/103 places, 95/99 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s96 1), p0:(AND (EQ s35 1) (EQ s39 1) (EQ s50 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]]
Stuttering criterion allowed to conclude after 41799 steps with 511 reset in 149 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-01 finished in 565 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 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:20:09] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:09] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-03 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:(AND (EQ s7 1) (EQ s9 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]]
Stuttering criterion allowed to conclude after 27164 steps with 257 reset in 85 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-03 finished in 527 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))))'
Support contains 8 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 14 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 20:20:09] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants in 70 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 90 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s17 1) (EQ s26 1) (OR (EQ s2 0) (EQ s10 0))), p0:(AND (EQ s36 1) (EQ s42 1) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 255 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-04 finished in 147 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) U p1) U (p0 U X(p2))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:20:09] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:20:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 20:20:09] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (NOT p2), true, p0, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 4}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s71 1) (EQ s75 1)), p1:(AND (EQ s63 1) (EQ s71 1) (EQ s77 1)), p2:(EQ s100 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2532 steps with 11 reset in 10 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-05 finished in 547 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) U X(G(!p1))))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-28 20:20:10] [INFO ] Invariant cache hit.
[2024-05-28 20:20:10] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s6 1) (EQ s17 1)), p1:(AND (EQ s88 1) (EQ s96 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33234 reset in 228 ms.
Product exploration explored 100000 steps with 33205 reset in 298 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 86 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Finished random walk after 240 steps, including 1 resets, run visited all 3 properties in 10 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:20:11] [INFO ] Invariant cache hit.
[2024-05-28 20:20:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 20:20:11] [INFO ] Invariant cache hit.
[2024-05-28 20:20:12] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-28 20:20:12] [INFO ] Invariant cache hit.
[2024-05-28 20:20:12] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 85 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Finished random walk after 113 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 173 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 33126 reset in 202 ms.
Product exploration explored 100000 steps with 33359 reset in 214 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) p1), p1, (NOT p0)]
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 5 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:20:13] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:20:13] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:20:13] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 99/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 103/103 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin5720144761026639619
[2024-05-28 20:20:13] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5720144761026639619
Running compilation step : cd /tmp/ltsmin5720144761026639619;'/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 327 ms.
Running link step : cd /tmp/ltsmin5720144761026639619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5720144761026639619;'/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/stateBased466963720579775314.hoa' '--buchi-type=spotba'
LTSmin run took 375 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-004A-LTLFireability-06 finished in 4107 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)) U (X(p0)&&(F(p1) U G(p2)))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:20:14] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:20:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-28 20:20:14] [INFO ] Invariant cache hit.
[2024-05-28 20:20:14] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-28 20:20:14] [INFO ] Invariant cache hit.
[2024-05-28 20:20:14] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s51 1), p1:(EQ s75 1), p0:(AND (EQ s80 1) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2048 steps with 14 reset in 5 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-07 finished in 597 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||X(X(F(p1))))))'
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:20:15] [INFO ] Invariant cache hit.
[2024-05-28 20:20:15] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 20:20:15] [INFO ] Invariant cache hit.
[2024-05-28 20:20:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-28 20:20:15] [INFO ] Invariant cache hit.
[2024-05-28 20:20:15] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s63 1) (EQ s71 1) (EQ s75 1)), p1:(EQ s89 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 3448 reset in 231 ms.
Product exploration explored 100000 steps with 3393 reset in 244 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 59 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 20:20:16] [INFO ] Invariant cache hit.
[2024-05-28 20:20:16] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-28 20:20:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 20:20:16] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 20:20:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:20:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2024-05-28 20:20:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 20:20:16] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-28 20:20:16] [INFO ] Computed and/alt/rep : 92/327/92 causal constraints (skipped 6 transitions) in 6 ms.
[2024-05-28 20:20:16] [INFO ] Added : 68 causal constraints over 14 iterations in 234 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:20:16] [INFO ] Invariant cache hit.
[2024-05-28 20:20:17] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-28 20:20:17] [INFO ] Invariant cache hit.
[2024-05-28 20:20:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-28 20:20:17] [INFO ] Invariant cache hit.
[2024-05-28 20:20:17] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 20:20:17] [INFO ] Invariant cache hit.
[2024-05-28 20:20:17] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2024-05-28 20:20:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 20:20:17] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-28 20:20:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:20:18] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2024-05-28 20:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 20:20:18] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-28 20:20:18] [INFO ] Computed and/alt/rep : 92/327/92 causal constraints (skipped 6 transitions) in 12 ms.
[2024-05-28 20:20:18] [INFO ] Added : 68 causal constraints over 14 iterations in 174 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3413 reset in 190 ms.
Product exploration explored 100000 steps with 3463 reset in 203 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 103 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 9 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:20:19] [INFO ] Redundant transitions in 20 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 98 rows 103 cols
[2024-05-28 20:20:19] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:20:19] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 103/103 places, 98/99 transitions.
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 103 /103 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 117 ms. Remains : 103/103 places, 98/99 transitions.
Built C files in :
/tmp/ltsmin3961243171294963906
[2024-05-28 20:20:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3961243171294963906
Running compilation step : cd /tmp/ltsmin3961243171294963906;'/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 183 ms.
Running link step : cd /tmp/ltsmin3961243171294963906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3961243171294963906;'/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/stateBased8537845155896779114.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:20:34] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:20:34] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 20:20:34] [INFO ] Invariant cache hit.
[2024-05-28 20:20:34] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-28 20:20:34] [INFO ] Invariant cache hit.
[2024-05-28 20:20:34] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 103/103 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin1407141512750443379
[2024-05-28 20:20:34] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1407141512750443379
Running compilation step : cd /tmp/ltsmin1407141512750443379;'/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 193 ms.
Running link step : cd /tmp/ltsmin1407141512750443379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1407141512750443379;'/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/stateBased13079927186220096115.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:20:49] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:20:49] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:20:49] [INFO ] Time to serialize gal into /tmp/LTL4305286493296670028.gal : 2 ms
[2024-05-28 20:20:49] [INFO ] Time to serialize properties into /tmp/LTL1464426386846069362.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/LTL4305286493296670028.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17883673712209824263.hoa' '-atoms' '/tmp/LTL1464426386846069362.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/LTL1464426386846069362.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17883673712209824263.hoa
Detected timeout of ITS tools.
[2024-05-28 20:21:04] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:21:04] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:21:04] [INFO ] Time to serialize gal into /tmp/LTL5065480068189630225.gal : 2 ms
[2024-05-28 20:21:04] [INFO ] Time to serialize properties into /tmp/LTL1912432454673852741.ltl : 2 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/LTL5065480068189630225.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1912432454673852741.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...275
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("(p89==1)"))))||("(((p63==1)&&(p71==1))&&(p75==1))"))))
Formula 0 simplified : G(!"(((p63==1)&&(p71==1))&&(p75==1))" & XXG!"(p89==1)")
Detected timeout of ITS tools.
[2024-05-28 20:21:19] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:21:19] [INFO ] Applying decomposition
[2024-05-28 20:21:19] [INFO ] Flatten gal took : 7 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/graph6711138539720690489.txt' '-o' '/tmp/graph6711138539720690489.bin' '-w' '/tmp/graph6711138539720690489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6711138539720690489.bin' '-l' '-1' '-v' '-w' '/tmp/graph6711138539720690489.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:21:19] [INFO ] Decomposing Gal with order
[2024-05-28 20:21:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:21:20] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 20:21:20] [INFO ] Flatten gal took : 61 ms
[2024-05-28 20:21:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 10 ms.
[2024-05-28 20:21:20] [INFO ] Time to serialize gal into /tmp/LTL8613413005515686826.gal : 2 ms
[2024-05-28 20:21:20] [INFO ] Time to serialize properties into /tmp/LTL14557080980993272123.ltl : 3 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/LTL8613413005515686826.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14557080980993272123.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((X(X(F("(i4.u33.p89==1)"))))||("(((i2.i0.u23.p63==1)&&(i2.i0.u26.p71==1))&&(i2.i0.u27.p75==1))"))))
Formula 0 simplified : G(!"(((i2.i0.u23.p63==1)&&(i2.i0.u26.p71==1))&&(i2.i0.u27.p75==1))" & XXG!"(i4.u33.p89==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10935333335541830110
[2024-05-28 20:21:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10935333335541830110
Running compilation step : cd /tmp/ltsmin10935333335541830110;'/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 184 ms.
Running link step : cd /tmp/ltsmin10935333335541830110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin10935333335541830110;'/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' '<>((X(X(<>((LTLAPp0==true))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-08 finished in 95132 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((G((X(!p1) U p2))||p0))))'
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:21:50] [INFO ] Invariant cache hit.
[2024-05-28 20:21:50] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-28 20:21:50] [INFO ] Invariant cache hit.
[2024-05-28 20:21:50] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-28 20:21:50] [INFO ] Invariant cache hit.
[2024-05-28 20:21:50] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s58 0) (EQ s72 0)), p2:(AND (EQ s64 1) (EQ s85 1)), p1:(OR (AND (EQ s36 1) (EQ s40 1) (EQ s51 1)) (NOT (AND (EQ s64 1) (EQ s85 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 811 reset in 210 ms.
Product exploration explored 100000 steps with 826 reset in 227 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 22 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 177 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:21:51] [INFO ] Invariant cache hit.
[2024-05-28 20:21:51] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 20:21:51] [INFO ] Invariant cache hit.
[2024-05-28 20:21:51] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-28 20:21:51] [INFO ] Invariant cache hit.
[2024-05-28 20:21:51] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 103/103 places, 99/99 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 143 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=14 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 809 reset in 213 ms.
Product exploration explored 100000 steps with 833 reset in 232 ms.
Built C files in :
/tmp/ltsmin17863496372513959776
[2024-05-28 20:21:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17863496372513959776
Running compilation step : cd /tmp/ltsmin17863496372513959776;'/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 191 ms.
Running link step : cd /tmp/ltsmin17863496372513959776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17863496372513959776;'/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/stateBased17041447373718293598.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:22:08] [INFO ] Invariant cache hit.
[2024-05-28 20:22:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 20:22:08] [INFO ] Invariant cache hit.
[2024-05-28 20:22:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-28 20:22:08] [INFO ] Invariant cache hit.
[2024-05-28 20:22:08] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 103/103 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin16744306860102146178
[2024-05-28 20:22:08] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16744306860102146178
Running compilation step : cd /tmp/ltsmin16744306860102146178;'/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 192 ms.
Running link step : cd /tmp/ltsmin16744306860102146178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16744306860102146178;'/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/stateBased14593720776403874157.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:22:23] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:22:23] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:22:23] [INFO ] Time to serialize gal into /tmp/LTL7347093187219818726.gal : 3 ms
[2024-05-28 20:22:23] [INFO ] Time to serialize properties into /tmp/LTL13813489348132951240.prop : 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/LTL7347093187219818726.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3906821033102813781.hoa' '-atoms' '/tmp/LTL13813489348132951240.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/LTL13813489348132951240.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3906821033102813781.hoa
Detected timeout of ITS tools.
[2024-05-28 20:22:38] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:22:38] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:22:38] [INFO ] Time to serialize gal into /tmp/LTL10352037356803278746.gal : 1 ms
[2024-05-28 20:22:38] [INFO ] Time to serialize properties into /tmp/LTL696644099120792977.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/LTL10352037356803278746.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL696644099120792977.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...275
Read 1 LTL properties
Checking formula 0 : !((G(F(((G((X(!("((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")))U("((p64==1)&&(p85==1))")))||("(p58==0)"))||("(p72==0)...161
Formula 0 simplified : G(F(!"((p64==1)&&(p85==1))" & X(!"((p64==1)&&(p85==1))" W "((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")) & FG(!"(p5...177
Detected timeout of ITS tools.
[2024-05-28 20:22:53] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:22:53] [INFO ] Applying decomposition
[2024-05-28 20:22:53] [INFO ] Flatten gal took : 6 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/graph4593344547446367198.txt' '-o' '/tmp/graph4593344547446367198.bin' '-w' '/tmp/graph4593344547446367198.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4593344547446367198.bin' '-l' '-1' '-v' '-w' '/tmp/graph4593344547446367198.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:22:53] [INFO ] Decomposing Gal with order
[2024-05-28 20:22:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:22:53] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 20:22:53] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:22:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 5 ms.
[2024-05-28 20:22:53] [INFO ] Time to serialize gal into /tmp/LTL18272227000416490531.gal : 3 ms
[2024-05-28 20:22:53] [INFO ] Time to serialize properties into /tmp/LTL13367292210714735153.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/LTL18272227000416490531.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13367292210714735153.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F(((G((X(!("((((i1.i0.u13.p36==1)&&(i1.i0.u15.p40==1))&&(i1.i2.u18.p51==1))||(!((i2.i0.u24.p64==1)&&(i4.u31.p85==1))))")))U("((i2...245
Formula 0 simplified : G(F(!"((i2.i0.u24.p64==1)&&(i4.u31.p85==1))" & X(!"((i2.i0.u24.p64==1)&&(i4.u31.p85==1))" W "((((i1.i0.u13.p36==1)&&(i1.i0.u15.p40==...278
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12803015086969594723
[2024-05-28 20:23:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12803015086969594723
Running compilation step : cd /tmp/ltsmin12803015086969594723;'/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 184 ms.
Running link step : cd /tmp/ltsmin12803015086969594723;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin12803015086969594723;'/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' '[](<>(([]((X(!(LTLAPp1==true)) U (LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-09 finished in 93867 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 2 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
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 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 8 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 20:23:24] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:23:24] [INFO ] Implicit Places using invariants in 76 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 88 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-10 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:(AND (EQ s53 1) (EQ s74 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 7096 reset in 157 ms.
Product exploration explored 100000 steps with 7122 reset in 181 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F 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 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 20:23:25] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 20:23:25] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 20:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 20:23:25] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2024-05-28 20:23:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:23:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-28 20:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 20:23:25] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 20:23:25] [INFO ] Computed and/alt/rep : 90/325/90 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-28 20:23:25] [INFO ] Added : 57 causal constraints over 12 iterations in 169 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 20:23:25] [INFO ] Invariant cache hit.
[2024-05-28 20:23:25] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 20:23:25] [INFO ] Invariant cache hit.
[2024-05-28 20:23:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-28 20:23:25] [INFO ] Redundant transitions in 18 ms returned [91]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 20:23:25] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 20:23:25] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 96/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 257 ms. Remains : 100/100 places, 96/97 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 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 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
[2024-05-28 20:23:26] [INFO ] Invariant cache hit.
[2024-05-28 20:23:26] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-28 20:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 20:23:26] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 20:23:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:23:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-28 20:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 20:23:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 20:23:26] [INFO ] Computed and/alt/rep : 90/330/90 causal constraints (skipped 5 transitions) in 10 ms.
[2024-05-28 20:23:26] [INFO ] Added : 64 causal constraints over 14 iterations in 203 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7094 reset in 156 ms.
Product exploration explored 100000 steps with 7112 reset in 181 ms.
Built C files in :
/tmp/ltsmin6747104695065606847
[2024-05-28 20:23:26] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-28 20:23:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:26] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-28 20:23:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:26] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-28 20:23:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:26] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6747104695065606847
Running compilation step : cd /tmp/ltsmin6747104695065606847;'/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 196 ms.
Running link step : cd /tmp/ltsmin6747104695065606847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin6747104695065606847;'/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/stateBased651817749688945593.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-05-28 20:23:42] [INFO ] Invariant cache hit.
[2024-05-28 20:23:42] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-28 20:23:42] [INFO ] Invariant cache hit.
[2024-05-28 20:23:42] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2024-05-28 20:23:42] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-28 20:23:42] [INFO ] Invariant cache hit.
[2024-05-28 20:23:42] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 245 ms. Remains : 100/100 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin3312364294355458715
[2024-05-28 20:23:42] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2024-05-28 20:23:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:42] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2024-05-28 20:23:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:42] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2024-05-28 20:23:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:23:42] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3312364294355458715
Running compilation step : cd /tmp/ltsmin3312364294355458715;'/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 199 ms.
Running link step : cd /tmp/ltsmin3312364294355458715;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3312364294355458715;'/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/stateBased13375243568334652297.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:23:57] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:23:57] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:23:57] [INFO ] Time to serialize gal into /tmp/LTL7890000670082441550.gal : 2 ms
[2024-05-28 20:23:57] [INFO ] Time to serialize properties into /tmp/LTL2113726020815046243.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/LTL7890000670082441550.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8645371169412194162.hoa' '-atoms' '/tmp/LTL2113726020815046243.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...317
Loading property file /tmp/LTL2113726020815046243.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8645371169412194162.hoa
Detected timeout of ITS tools.
[2024-05-28 20:24:12] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:24:12] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:24:12] [INFO ] Time to serialize gal into /tmp/LTL2668450999616284676.gal : 11 ms
[2024-05-28 20:24:12] [INFO ] Time to serialize properties into /tmp/LTL10239286575703743147.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/LTL2668450999616284676.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10239286575703743147.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p53==1)&&(p74==1))"))))
Formula 0 simplified : FG!"((p53==1)&&(p74==1))"
Detected timeout of ITS tools.
[2024-05-28 20:24:27] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:24:27] [INFO ] Applying decomposition
[2024-05-28 20:24:27] [INFO ] Flatten gal took : 6 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/graph7291189893009620362.txt' '-o' '/tmp/graph7291189893009620362.bin' '-w' '/tmp/graph7291189893009620362.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7291189893009620362.bin' '-l' '-1' '-v' '-w' '/tmp/graph7291189893009620362.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:24:27] [INFO ] Decomposing Gal with order
[2024-05-28 20:24:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:24:27] [INFO ] Removed a total of 59 redundant transitions.
[2024-05-28 20:24:27] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:24:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 4 ms.
[2024-05-28 20:24:27] [INFO ] Time to serialize gal into /tmp/LTL16641636950631298553.gal : 4 ms
[2024-05-28 20:24:27] [INFO ] Time to serialize properties into /tmp/LTL17434059418078032252.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/LTL16641636950631298553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17434059418078032252.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.i0.u19.p53==1)&&(i4.i1.u27.p74==1))"))))
Formula 0 simplified : FG!"((i4.i0.u19.p53==1)&&(i4.i1.u27.p74==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16734930151622660793
[2024-05-28 20:24:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16734930151622660793
Running compilation step : cd /tmp/ltsmin16734930151622660793;'/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 187 ms.
Running link step : cd /tmp/ltsmin16734930151622660793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16734930151622660793;'/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)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-10 finished in 93681 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)))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 103 cols
[2024-05-28 20:24:57] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:24:57] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-28 20:24:57] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s86 1) (EQ s90 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-11 finished in 423 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)&&X(p1)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 242 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s83 0) (EQ s98 0)), p1:(AND (EQ s38 1) (EQ s48 1) (EQ s50 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, 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 ShieldIIPs-PT-004A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-12 finished in 391 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(p0)&&G(p1)) U (G((X(p0)&&G(p1)))||(X(p0)&&G(p1)&&G((F(!p2)&&F(!p3))))))))'
Support contains 9 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-28 20:24:58] [INFO ] Invariant cache hit.
[2024-05-28 20:24:58] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 226 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3) (AND (NOT p0) p1)), (NOT p1), p2, p3, (OR p2 p3), (OR (AND (NOT p0) p2) (AND (NOT p1) p2) (AND (NOT p1) p3) (AND (NOT p0) p3))]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 7}, { cond=(AND p1 p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={0} source=5 dest: 5}], [{ cond=p3, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 5}, { cond=p3, acceptance={} source=7 dest: 6}, { cond=true, acceptance={} source=7 dest: 7}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=8 dest: 5}, { cond=(OR (AND (NOT p1) p3) (AND (NOT p0) p3)), acceptance={} source=8 dest: 6}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(AND (EQ s33 1) (EQ s48 1)), p0:(EQ s89 1), p2:(AND (EQ s61 1) (EQ s67 1) (EQ s76 1)), p3:(AND (EQ s88 1) (EQ s96 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-13 finished in 607 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(((p0||F(p1)) U p2)))'
Support contains 5 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Applied a total of 0 rules in 0 ms. Remains 103 /103 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-28 20:24:59] [INFO ] Invariant cache hit.
[2024-05-28 20:24:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 20:24:59] [INFO ] Invariant cache hit.
[2024-05-28 20:24:59] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 20:24:59] [INFO ] Invariant cache hit.
[2024-05-28 20:24:59] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 103/103 places, 99/99 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s29 1) (EQ s44 1) (EQ s72 1)), p0:(NEQ s72 1), p1:(OR (AND (EQ s29 1) (EQ s44 1)) (AND (EQ s31 1) (EQ s42 1)))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 12833 steps with 288 reset in 32 ms.
FORMULA ShieldIIPs-PT-004A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-004A-LTLFireability-14 finished in 396 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))'
Support contains 3 out of 103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
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 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 7 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 20:24:59] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:24:59] [INFO ] Implicit Places using invariants in 69 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 100/103 places, 97/99 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 0) (OR (EQ s82 0) (EQ s84 0)))], 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 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-004A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-004A-LTLFireability-15 finished in 550 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||X(X(F(p1))))))'
Found a Shortening insensitive property : ShieldIIPs-PT-004A-LTLFireability-08
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 transitions.
Reduce places removed 1 places and 1 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 102 transition count 97
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 100 transition count 97
Applied a total of 3 rules in 10 ms. Remains 100 /103 variables (removed 3) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 20:25:00] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 20:25:00] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 20:25:00] [INFO ] Invariant cache hit.
[2024-05-28 20:25:00] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 20:25:00] [INFO ] Invariant cache hit.
[2024-05-28 20:25:00] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 262 ms. Remains : 100/103 places, 97/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s62 1) (EQ s70 1) (EQ s74 1)), p1:(EQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3907 reset in 183 ms.
Product exploration explored 100000 steps with 3869 reset in 202 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 p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 28 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=28 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 20:25:01] [INFO ] Invariant cache hit.
[2024-05-28 20:25:01] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 20:25:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 20:25:01] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-28 20:25:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 20:25:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 20:25:01] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 20:25:01] [INFO ] Computed and/alt/rep : 96/237/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 20:25:02] [INFO ] Added : 84 causal constraints over 21 iterations in 305 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 20:25:02] [INFO ] Invariant cache hit.
[2024-05-28 20:25:02] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 20:25:02] [INFO ] Invariant cache hit.
[2024-05-28 20:25:02] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-28 20:25:02] [INFO ] Invariant cache hit.
[2024-05-28 20:25:02] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 100/100 places, 97/97 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 p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-28 20:25:03] [INFO ] Invariant cache hit.
[2024-05-28 20:25:03] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 20:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 20:25:03] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-28 20:25:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 20:25:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-28 20:25:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 20:25:03] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-28 20:25:03] [INFO ] Computed and/alt/rep : 96/237/96 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 20:25:03] [INFO ] Added : 84 causal constraints over 21 iterations in 266 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3864 reset in 184 ms.
Product exploration explored 100000 steps with 3920 reset in 199 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 20:25:04] [INFO ] Redundant transitions in 21 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 96 rows 100 cols
[2024-05-28 20:25:04] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 20:25:04] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 96/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 102 ms. Remains : 100/100 places, 96/97 transitions.
Built C files in :
/tmp/ltsmin9787249376762990005
[2024-05-28 20:25:04] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9787249376762990005
Running compilation step : cd /tmp/ltsmin9787249376762990005;'/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 186 ms.
Running link step : cd /tmp/ltsmin9787249376762990005;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9787249376762990005;'/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/stateBased11120881081690515102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 20:25:19] [INFO ] Computed 36 invariants in 2 ms
[2024-05-28 20:25:19] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 20:25:19] [INFO ] Invariant cache hit.
[2024-05-28 20:25:19] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-28 20:25:19] [INFO ] Invariant cache hit.
[2024-05-28 20:25:19] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 100/100 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin8828173522701344852
[2024-05-28 20:25:19] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8828173522701344852
Running compilation step : cd /tmp/ltsmin8828173522701344852;'/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 199 ms.
Running link step : cd /tmp/ltsmin8828173522701344852;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8828173522701344852;'/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/stateBased1618933851475615123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:25:34] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:25:34] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:25:34] [INFO ] Time to serialize gal into /tmp/LTL18087874193846186651.gal : 1 ms
[2024-05-28 20:25:34] [INFO ] Time to serialize properties into /tmp/LTL15791264149250217212.prop : 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/LTL18087874193846186651.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16754445040736601405.hoa' '-atoms' '/tmp/LTL15791264149250217212.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...320
Loading property file /tmp/LTL15791264149250217212.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16754445040736601405.hoa
Detected timeout of ITS tools.
[2024-05-28 20:25:49] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:25:49] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:25:49] [INFO ] Time to serialize gal into /tmp/LTL6774063538577781470.gal : 1 ms
[2024-05-28 20:25:49] [INFO ] Time to serialize properties into /tmp/LTL5040139291897368563.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/LTL6774063538577781470.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5040139291897368563.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...275
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("(p89==1)"))))||("(((p63==1)&&(p71==1))&&(p75==1))"))))
Formula 0 simplified : G(!"(((p63==1)&&(p71==1))&&(p75==1))" & XXG!"(p89==1)")
Detected timeout of ITS tools.
[2024-05-28 20:26:04] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:26:04] [INFO ] Applying decomposition
[2024-05-28 20:26:04] [INFO ] Flatten gal took : 4 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/graph13734377844469819677.txt' '-o' '/tmp/graph13734377844469819677.bin' '-w' '/tmp/graph13734377844469819677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13734377844469819677.bin' '-l' '-1' '-v' '-w' '/tmp/graph13734377844469819677.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:26:04] [INFO ] Decomposing Gal with order
[2024-05-28 20:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:26:04] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-28 20:26:04] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 3 ms.
[2024-05-28 20:26:04] [INFO ] Time to serialize gal into /tmp/LTL14705794196235842822.gal : 2 ms
[2024-05-28 20:26:04] [INFO ] Time to serialize properties into /tmp/LTL14717200125468286500.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/LTL14705794196235842822.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14717200125468286500.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...256
Read 1 LTL properties
Checking formula 0 : !((F((X(X(F("(i3.u32.p89==1)"))))||("(((i2.i2.u23.p63==1)&&(i2.i2.u26.p71==1))&&(i2.i2.u27.p75==1))"))))
Formula 0 simplified : G(!"(((i2.i2.u23.p63==1)&&(i2.i2.u26.p71==1))&&(i2.i2.u27.p75==1))" & XXG!"(i3.u32.p89==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7943288487243443851
[2024-05-28 20:26:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7943288487243443851
Running compilation step : cd /tmp/ltsmin7943288487243443851;'/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 190 ms.
Running link step : cd /tmp/ltsmin7943288487243443851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7943288487243443851;'/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' '<>((X(X(<>((LTLAPp0==true))))||(LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-08 finished in 94904 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((G((X(!p1) U p2))||p0))))'
Found a Lengthening insensitive property : ShieldIIPs-PT-004A-LTLFireability-09
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 103 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 103/103 places, 99/99 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 103 transition count 98
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 102 transition count 98
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 0 with 2 rules applied. Total rules applied 4 place count 101 transition count 97
Applied a total of 4 rules in 6 ms. Remains 101 /103 variables (removed 2) and now considering 97/99 (removed 2) transitions.
// Phase 1: matrix 97 rows 101 cols
[2024-05-28 20:26:35] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:26:35] [INFO ] Implicit Places using invariants in 76 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 77 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 100/103 places, 97/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 86 ms. Remains : 100/103 places, 97/99 transitions.
Running random walk in product with property : ShieldIIPs-PT-004A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s58 0) (EQ s72 0)), p2:(AND (EQ s64 1) (EQ s85 1)), p1:(OR (AND (EQ s36 1) (EQ s40 1) (EQ s51 1)) (NOT (AND (EQ s64 1) (EQ s85 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 832 reset in 213 ms.
Product exploration explored 100000 steps with 841 reset in 227 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 25 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=8 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 157 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 100 cols
[2024-05-28 20:26:36] [INFO ] Computed 36 invariants in 0 ms
[2024-05-28 20:26:36] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 20:26:36] [INFO ] Invariant cache hit.
[2024-05-28 20:26:36] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-28 20:26:36] [INFO ] Invariant cache hit.
[2024-05-28 20:26:36] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 222 ms. Remains : 100/100 places, 97/97 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 142 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 146 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 867 reset in 215 ms.
Product exploration explored 100000 steps with 844 reset in 227 ms.
Built C files in :
/tmp/ltsmin5645587411849861706
[2024-05-28 20:26:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5645587411849861706
Running compilation step : cd /tmp/ltsmin5645587411849861706;'/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 187 ms.
Running link step : cd /tmp/ltsmin5645587411849861706;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5645587411849861706;'/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/stateBased17002898498531888990.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2024-05-28 20:26:52] [INFO ] Invariant cache hit.
[2024-05-28 20:26:53] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-28 20:26:53] [INFO ] Invariant cache hit.
[2024-05-28 20:26:53] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 20:26:53] [INFO ] Invariant cache hit.
[2024-05-28 20:26:53] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 100/100 places, 97/97 transitions.
Built C files in :
/tmp/ltsmin10414154710916068511
[2024-05-28 20:26:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10414154710916068511
Running compilation step : cd /tmp/ltsmin10414154710916068511;'/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 208 ms.
Running link step : cd /tmp/ltsmin10414154710916068511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10414154710916068511;'/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/stateBased3035554924487905846.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 20:27:08] [INFO ] Flatten gal took : 15 ms
[2024-05-28 20:27:08] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:27:08] [INFO ] Time to serialize gal into /tmp/LTL13819774015829216050.gal : 1 ms
[2024-05-28 20:27:08] [INFO ] Time to serialize properties into /tmp/LTL4361025294682367737.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/LTL13819774015829216050.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7838106082193285016.hoa' '-atoms' '/tmp/LTL4361025294682367737.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/LTL4361025294682367737.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7838106082193285016.hoa
Detected timeout of ITS tools.
[2024-05-28 20:27:23] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:27:23] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:27:23] [INFO ] Time to serialize gal into /tmp/LTL16784188568643476912.gal : 1 ms
[2024-05-28 20:27:23] [INFO ] Time to serialize properties into /tmp/LTL14348439652435853498.ltl : 2 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/LTL16784188568643476912.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14348439652435853498.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 : !((G(F(((G((X(!("((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")))U("((p64==1)&&(p85==1))")))||("(p58==0)"))||("(p72==0)...161
Formula 0 simplified : G(F(!"((p64==1)&&(p85==1))" & X(!"((p64==1)&&(p85==1))" W "((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")) & FG(!"(p5...177
Detected timeout of ITS tools.
[2024-05-28 20:27:38] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:27:38] [INFO ] Applying decomposition
[2024-05-28 20:27:38] [INFO ] Flatten gal took : 5 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/graph4043038654184480880.txt' '-o' '/tmp/graph4043038654184480880.bin' '-w' '/tmp/graph4043038654184480880.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4043038654184480880.bin' '-l' '-1' '-v' '-w' '/tmp/graph4043038654184480880.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:27:38] [INFO ] Decomposing Gal with order
[2024-05-28 20:27:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:27:38] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-28 20:27:38] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:27:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 3 ms.
[2024-05-28 20:27:38] [INFO ] Time to serialize gal into /tmp/LTL10868349820892690886.gal : 2 ms
[2024-05-28 20:27:38] [INFO ] Time to serialize properties into /tmp/LTL12627770257537188230.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/LTL10868349820892690886.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12627770257537188230.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...256
Read 1 LTL properties
Checking formula 0 : !((G(F(((G((X(!("((((i2.u13.p36==1)&&(i2.u15.p40==1))&&(i1.i1.u18.p51==1))||(!((i3.u24.p64==1)&&(i5.i0.u31.p85==1))))")))U("((i3.u24.p...239
Formula 0 simplified : G(F(!"((i3.u24.p64==1)&&(i5.i0.u31.p85==1))" & X(!"((i3.u24.p64==1)&&(i5.i0.u31.p85==1))" W "((((i2.u13.p36==1)&&(i2.u15.p40==1))&&(...272
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7546441460944324961
[2024-05-28 20:27:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7546441460944324961
Running compilation step : cd /tmp/ltsmin7546441460944324961;'/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 189 ms.
Running link step : cd /tmp/ltsmin7546441460944324961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin7546441460944324961;'/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' '[](<>(([]((X(!(LTLAPp1==true)) U (LTLAPp2==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-004A-LTLFireability-09 finished in 93586 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)))'
[2024-05-28 20:28:08] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9251257010405179387
[2024-05-28 20:28:08] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-28 20:28:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:28:08] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-28 20:28:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:28:08] [INFO ] Applying decomposition
[2024-05-28 20:28:08] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-28 20:28:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 20:28:08] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:28:08] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9251257010405179387
Running compilation step : cd /tmp/ltsmin9251257010405179387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' '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'
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/graph16736063650575804053.txt' '-o' '/tmp/graph16736063650575804053.bin' '-w' '/tmp/graph16736063650575804053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16736063650575804053.bin' '-l' '-1' '-v' '-w' '/tmp/graph16736063650575804053.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:28:08] [INFO ] Decomposing Gal with order
[2024-05-28 20:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:28:08] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-28 20:28:08] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:28:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2024-05-28 20:28:08] [INFO ] Time to serialize gal into /tmp/LTLFireability3575627296618925449.gal : 2 ms
[2024-05-28 20:28:08] [INFO ] Time to serialize properties into /tmp/LTLFireability13045926505175123130.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/LTLFireability3575627296618925449.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13045926505175123130.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...277
Read 3 LTL properties
Checking formula 0 : !((F(("(((i2.i1.u23.p63==1)&&(i2.i1.u26.p71==1))&&(i2.i1.u27.p75==1))")||(X(X(F("(i4.u33.p89==1)")))))))
Formula 0 simplified : G(!"(((i2.i1.u23.p63==1)&&(i2.i1.u26.p71==1))&&(i2.i1.u27.p75==1))" & XXG!"(i4.u33.p89==1)")
Compilation finished in 228 ms.
Running link step : cd /tmp/ltsmin9251257010405179387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9251257010405179387;'/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)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin9251257010405179387;'/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)||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9251257010405179387;'/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' '[](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 20:50:49] [INFO ] Applying decomposition
[2024-05-28 20:50:49] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:50:49] [INFO ] Decomposing Gal with order
[2024-05-28 20:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:50:49] [INFO ] Removed a total of 68 redundant transitions.
[2024-05-28 20:50:49] [INFO ] Flatten gal took : 27 ms
[2024-05-28 20:50:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 17 ms.
[2024-05-28 20:50:49] [INFO ] Time to serialize gal into /tmp/LTLFireability10046602118614847869.gal : 10 ms
[2024-05-28 20:50:49] [INFO ] Time to serialize properties into /tmp/LTLFireability12072555196627894771.ltl : 7 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/LTLFireability10046602118614847869.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12072555196627894771.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 3 LTL properties
Checking formula 0 : !((F(("(((u27.p63==1)&&(u30.p71==1))&&(u31.p75==1))")||(X(X(F("(u38.p89==1)")))))))
Formula 0 simplified : G(!"(((u27.p63==1)&&(u30.p71==1))&&(u31.p75==1))" & XXG!"(u38.p89==1)")
Reverse transition relation is NOT exact ! Due to transitions t40, t41, t46, t48, t55, t57, t66, t67, t70, t71, t80, t82, t85, t86, t95, t98, u8.t1, u8.t2,...488
Computing Next relation with stutter on 7520 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: LTL layer: formula: [](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==true)))||(LTLAPp2==true))))
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: "[](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==true)))||(LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 0.036: There are 106 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.036: State length is 104, there are 105 groups
pins2lts-mc-linux64( 0/ 8), 0.036: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.036: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.036: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.036: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.044: [Blue] ~40 levels ~960 states ~2256 transitions
pins2lts-mc-linux64( 2/ 8), 0.046: [Blue] ~40 levels ~1920 states ~4832 transitions
pins2lts-mc-linux64( 2/ 8), 0.056: [Blue] ~40 levels ~3840 states ~10464 transitions
pins2lts-mc-linux64( 2/ 8), 0.161: [Blue] ~43 levels ~7680 states ~21408 transitions
pins2lts-mc-linux64( 2/ 8), 0.234: [Blue] ~43 levels ~15360 states ~46880 transitions
pins2lts-mc-linux64( 2/ 8), 0.484: [Blue] ~44 levels ~30720 states ~100384 transitions
pins2lts-mc-linux64( 2/ 8), 1.092: [Blue] ~46 levels ~61440 states ~197784 transitions
pins2lts-mc-linux64( 2/ 8), 1.428: [Blue] ~46 levels ~122880 states ~418912 transitions
pins2lts-mc-linux64( 2/ 8), 2.052: [Blue] ~378 levels ~245760 states ~867216 transitions
pins2lts-mc-linux64( 4/ 8), 3.021: [Blue] ~200 levels ~491520 states ~1908264 transitions
pins2lts-mc-linux64( 4/ 8), 4.404: [Blue] ~200 levels ~983040 states ~3956776 transitions
pins2lts-mc-linux64( 5/ 8), 8.314: [Blue] ~3402 levels ~1966080 states ~11317504 transitions
pins2lts-mc-linux64( 5/ 8), 14.694: [Blue] ~3453 levels ~3932160 states ~22103176 transitions
pins2lts-mc-linux64( 5/ 8), 26.265: [Blue] ~3453 levels ~7864320 states ~49116144 transitions
pins2lts-mc-linux64( 4/ 8), 46.570: [Blue] ~206 levels ~15728640 states ~78279608 transitions
pins2lts-mc-linux64( 4/ 8), 85.231: [Blue] ~206 levels ~31457280 states ~166972120 transitions
pins2lts-mc-linux64( 4/ 8), 153.714: [Blue] ~206 levels ~62914560 states ~313872616 transitions
pins2lts-mc-linux64( 4/ 8), 309.771: [Blue] ~206 levels ~125829120 states ~653620800 transitions
pins2lts-mc-linux64( 1/ 8), 422.194: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 422.235:
pins2lts-mc-linux64( 0/ 8), 422.235: Explored 138209467 states 1018435351 transitions, fanout: 7.369
pins2lts-mc-linux64( 0/ 8), 422.235: Total exploration time 422.190 sec (422.120 sec minimum, 422.146 sec on average)
pins2lts-mc-linux64( 0/ 8), 422.235: States per second: 327363, Transitions per second: 2412268
pins2lts-mc-linux64( 0/ 8), 422.235:
pins2lts-mc-linux64( 0/ 8), 422.235: State space has 134216975 states, 32597840 are accepting
pins2lts-mc-linux64( 0/ 8), 422.235: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 422.235: blue states: 138209467 (102.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 422.235: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 422.235: all-red states: 66712667 (49.71%), bogus 181291 (0.14%)
pins2lts-mc-linux64( 0/ 8), 422.236:
pins2lts-mc-linux64( 0/ 8), 422.236: Total memory used for local state coloring: 9.1MB
pins2lts-mc-linux64( 0/ 8), 422.236:
pins2lts-mc-linux64( 0/ 8), 422.236: Queue width: 8B, total height: 594207, memory: 4.53MB
pins2lts-mc-linux64( 0/ 8), 422.236: Tree memory: 1027.1MB, 8.0 B/state, compr.: 1.9%
pins2lts-mc-linux64( 0/ 8), 422.236: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 422.236: Stored 100 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 422.236: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 422.236: Est. total memory use: 1031.6MB (~1028.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9251257010405179387;'/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' '[](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==true)))||(LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9251257010405179387;'/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' '[](<>(([]((X(!(LTLAPp3==true)) U (LTLAPp4==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)
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
27051 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,270.514,2692520,1,0,5.09179e+06,169,547,1.18153e+07,73,362,684419
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldIIPs-PT-004A-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(((G((X(!("((((u16.p36==1)&&(u18.p40==1))&&(u21.p51==1))||(!((u28.p64==1)&&(u36.p85==1))))")))U("((u28.p64==1)&&(u36.p85==1))"))...201
Formula 1 simplified : G(F(!"((u28.p64==1)&&(u36.p85==1))" & X(!"((u28.p64==1)&&(u36.p85==1))" W "((((u16.p36==1)&&(u18.p40==1))&&(u21.p51==1))||(!((u28.p6...225
Computing Next relation with stutter on 7520 deadlock states
Detected timeout of ITS tools.
[2024-05-28 21:13:34] [INFO ] Flatten gal took : 123 ms
[2024-05-28 21:13:34] [INFO ] Input system was already deterministic with 99 transitions.
[2024-05-28 21:13:35] [INFO ] Transformed 103 places.
[2024-05-28 21:13:35] [INFO ] Transformed 99 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-28 21:13:35] [INFO ] Time to serialize gal into /tmp/LTLFireability13903747983476422445.gal : 8 ms
[2024-05-28 21:13:35] [INFO ] Time to serialize properties into /tmp/LTLFireability16689947194592436633.ltl : 7 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/LTLFireability13903747983476422445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16689947194592436633.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...344
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(((G((X(!("((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")))U("((p64==1)&&(p85==1))")))||("(p58==0)"))||("(p72==0)...161
Formula 0 simplified : G(F(!"((p64==1)&&(p85==1))" & X(!"((p64==1)&&(p85==1))" W "((((p36==1)&&(p40==1))&&(p51==1))||(!((p64==1)&&(p85==1))))")) & FG(!"(p5...177
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...455
Computing Next relation with stutter on 7520 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12177768 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15973080 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="ShieldIIPs-PT-004A"
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 ShieldIIPs-PT-004A, 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 r373-tall-171683788300033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-004A.tgz
mv ShieldIIPs-PT-004A 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 ;