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-171683788600137.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 ShieldIIPt-PT-003B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788600137
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K 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:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 12 20:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 50K 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 ShieldIIPt-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716949674277

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 02:27:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 02:27:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 02:27:56] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-29 02:27:56] [INFO ] Transformed 213 places.
[2024-05-29 02:27:56] [INFO ] Transformed 198 transitions.
[2024-05-29 02:27:56] [INFO ] Found NUPN structural information;
[2024-05-29 02:27:56] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-003B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 183 transition count 168
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 182 transition count 167
Applied a total of 62 rules in 88 ms. Remains 182 /213 variables (removed 31) and now considering 167/198 (removed 31) transitions.
// Phase 1: matrix 167 rows 182 cols
[2024-05-29 02:27:56] [INFO ] Computed 28 invariants in 19 ms
[2024-05-29 02:27:56] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-29 02:27:56] [INFO ] Invariant cache hit.
[2024-05-29 02:27:57] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-29 02:27:57] [INFO ] Invariant cache hit.
[2024-05-29 02:27:57] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 182/213 places, 167/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 655 ms. Remains : 182/213 places, 167/198 transitions.
Support contains 18 out of 182 places after structural reductions.
[2024-05-29 02:27:57] [INFO ] Flatten gal took : 35 ms
[2024-05-29 02:27:57] [INFO ] Flatten gal took : 14 ms
[2024-05-29 02:27:57] [INFO ] Input system was already deterministic with 167 transitions.
Finished random walk after 358 steps, including 0 resets, run visited all 13 properties in 33 ms. (steps per millisecond=10 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 49 stabilizing places and 49 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' '!(F(G(p0)))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 181 transition count 129
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 144 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 74 place count 144 transition count 107
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 118 place count 122 transition count 107
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 120 transition count 105
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 120 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 122 place count 120 transition count 104
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 222 place count 70 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 223 place count 70 transition count 54
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 3 with 2 rules applied. Total rules applied 225 place count 69 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 239 place count 62 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 60 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 243 place count 58 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 243 place count 58 transition count 54
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 57 transition count 54
Applied a total of 245 rules in 45 ms. Remains 57 /182 variables (removed 125) and now considering 54/167 (removed 113) transitions.
// Phase 1: matrix 54 rows 57 cols
[2024-05-29 02:27:57] [INFO ] Computed 26 invariants in 0 ms
[2024-05-29 02:27:57] [INFO ] Implicit Places using invariants in 51 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 56/182 places, 54/167 transitions.
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 2 place count 55 transition count 53
Applied a total of 2 rules in 4 ms. Remains 55 /56 variables (removed 1) and now considering 53/54 (removed 1) transitions.
// Phase 1: matrix 53 rows 55 cols
[2024-05-29 02:27:57] [INFO ] Computed 25 invariants in 0 ms
[2024-05-29 02:27:57] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 02:27:57] [INFO ] Invariant cache hit.
[2024-05-29 02:27:58] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 55/182 places, 53/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 204 ms. Remains : 55/182 places, 53/167 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 166 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s16 0) (NEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-01 finished in 580 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)&&(p2||X(p0)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 180 transition count 165
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 180 transition count 165
Applied a total of 4 rules in 10 ms. Remains 180 /182 variables (removed 2) and now considering 165/167 (removed 2) transitions.
// Phase 1: matrix 165 rows 180 cols
[2024-05-29 02:27:58] [INFO ] Computed 28 invariants in 2 ms
[2024-05-29 02:27:58] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 02:27:58] [INFO ] Invariant cache hit.
[2024-05-29 02:27:58] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-29 02:27:58] [INFO ] Invariant cache hit.
[2024-05-29 02:27:58] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 180/182 places, 165/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 180/182 places, 165/167 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s27 0) (EQ s107 1)), p2:(AND (EQ s140 0) (EQ s151 1)), p1:(OR (EQ s151 0) (EQ s140 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 288 ms.
Product exploration explored 100000 steps with 33333 reset in 227 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (AND p0 (NOT p2))), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPt-PT-003B-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-02 finished in 1044 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((G((X(p1)||p0))||F(p2)))))'
Support contains 4 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 179 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 179 transition count 164
Applied a total of 6 rules in 9 ms. Remains 179 /182 variables (removed 3) and now considering 164/167 (removed 3) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-29 02:27:59] [INFO ] Computed 28 invariants in 2 ms
[2024-05-29 02:27:59] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 02:27:59] [INFO ] Invariant cache hit.
[2024-05-29 02:27:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-29 02:27:59] [INFO ] Invariant cache hit.
[2024-05-29 02:27:59] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/182 places, 164/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 179/182 places, 164/167 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s86 1)), p2:(OR (EQ s1 0) (EQ s86 1)), p1:(AND (EQ s178 0) (EQ s176 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][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 362 ms.
Product exploration explored 100000 steps with 2 reset in 369 ms.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND (NOT p0) (NOT p2))), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND (NOT p0) (NOT p2))), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 179/179 places, 164/164 transitions.
Applied a total of 0 rules in 4 ms. Remains 179 /179 variables (removed 0) and now considering 164/164 (removed 0) transitions.
[2024-05-29 02:28:01] [INFO ] Invariant cache hit.
[2024-05-29 02:28:01] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 02:28:01] [INFO ] Invariant cache hit.
[2024-05-29 02:28:01] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-29 02:28:01] [INFO ] Invariant cache hit.
[2024-05-29 02:28:01] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 179/179 places, 164/164 transitions.
Computed a total of 47 stabilizing places and 47 stable transitions
Computed a total of 47 stabilizing places and 47 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND (NOT p0) (NOT p2))), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (AND (NOT p0) (NOT p2))), true]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (AND (NOT p0) (NOT p2))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 2 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 271 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 4 out of 179 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 179/179 places, 164/164 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 179 transition count 164
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 179 transition count 174
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 179 transition count 174
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 104 place count 179 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 179 transition count 174
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 127 place count 157 transition count 152
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 149 place count 157 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 150 place count 157 transition count 152
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 152 place count 155 transition count 150
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 154 place count 155 transition count 150
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -51
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 164 place count 155 transition count 201
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 174 place count 145 transition count 181
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 184 place count 145 transition count 181
Deduced a syphon composed of 81 places in 0 ms
Applied a total of 184 rules in 44 ms. Remains 145 /179 variables (removed 34) and now considering 181/164 (removed -17) transitions.
[2024-05-29 02:28:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 181 rows 145 cols
[2024-05-29 02:28:03] [INFO ] Computed 28 invariants in 2 ms
[2024-05-29 02:28:03] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/179 places, 181/164 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 145/179 places, 181/164 transitions.
Built C files in :
/tmp/ltsmin10165952788460569090
[2024-05-29 02:28:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10165952788460569090
Running compilation step : cd /tmp/ltsmin10165952788460569090;'/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 378 ms.
Running link step : cd /tmp/ltsmin10165952788460569090;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin10165952788460569090;'/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/stateBased13644905827708687555.hoa' '--buchi-type=spotba'
LTSmin run took 226 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-04 finished in 5256 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 U X(G(p0)))))'
Support contains 1 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 179 transition count 164
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 179 transition count 164
Applied a total of 6 rules in 8 ms. Remains 179 /182 variables (removed 3) and now considering 164/167 (removed 3) transitions.
// Phase 1: matrix 164 rows 179 cols
[2024-05-29 02:28:04] [INFO ] Computed 28 invariants in 4 ms
[2024-05-29 02:28:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 02:28:04] [INFO ] Invariant cache hit.
[2024-05-29 02:28:04] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-29 02:28:04] [INFO ] Invariant cache hit.
[2024-05-29 02:28:04] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 179/182 places, 164/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 289 ms. Remains : 179/182 places, 164/167 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s108 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-05 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(G(p0)))'
Support contains 2 out of 182 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 181 transition count 129
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 144 transition count 129
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 74 place count 144 transition count 106
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 120 place count 121 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 119 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 124 place count 119 transition count 103
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 118 transition count 103
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 220 place count 71 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 221 place count 71 transition count 55
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 3 with 2 rules applied. Total rules applied 223 place count 70 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 239 place count 62 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 240 place count 61 transition count 58
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 242 place count 59 transition count 58
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 242 place count 59 transition count 57
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 244 place count 58 transition count 57
Applied a total of 244 rules in 28 ms. Remains 58 /182 variables (removed 124) and now considering 57/167 (removed 110) transitions.
// Phase 1: matrix 57 rows 58 cols
[2024-05-29 02:28:04] [INFO ] Computed 26 invariants in 1 ms
[2024-05-29 02:28:05] [INFO ] Implicit Places using invariants in 42 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 57/182 places, 57/167 transitions.
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 2 place count 56 transition count 56
Applied a total of 2 rules in 3 ms. Remains 56 /57 variables (removed 1) and now considering 56/57 (removed 1) transitions.
// Phase 1: matrix 56 rows 56 cols
[2024-05-29 02:28:05] [INFO ] Computed 25 invariants in 2 ms
[2024-05-29 02:28:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 02:28:05] [INFO ] Invariant cache hit.
[2024-05-29 02:28:05] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-29 02:28:05] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 56/182 places, 56/167 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 188 ms. Remains : 56/182 places, 56/167 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-07 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U X(p2)))||G(p3))))'
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 178 transition count 163
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 178 transition count 163
Applied a total of 8 rules in 11 ms. Remains 178 /182 variables (removed 4) and now considering 163/167 (removed 4) transitions.
// Phase 1: matrix 163 rows 178 cols
[2024-05-29 02:28:05] [INFO ] Computed 28 invariants in 2 ms
[2024-05-29 02:28:05] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 02:28:05] [INFO ] Invariant cache hit.
[2024-05-29 02:28:05] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-29 02:28:05] [INFO ] Invariant cache hit.
[2024-05-29 02:28:05] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 178/182 places, 163/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 178/182 places, 163/167 transitions.
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 p3 p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s70 0), p3:(AND (EQ s30 0) (EQ s130 1)), p1:(OR (EQ s37 0) (EQ s55 1)), p2:(OR (EQ s130 0) (EQ s30 1))], nbAcceptance=3, 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 33295 reset in 310 ms.
Product exploration explored 100000 steps with 33242 reset in 370 ms.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND p0 p3))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 50 factoid took 448 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=24 ) properties (out of 24) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 02:28:07] [INFO ] Invariant cache hit.
[2024-05-29 02:28:07] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 02:28:07] [INFO ] [Nat]Absence check using 28 positive place invariants in 6 ms returned sat
[2024-05-29 02:28:07] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (NOT (AND p0 p3))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND p0 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p3))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND p0 p3)), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) p3)), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (AND p0 p1 p3 (NOT p2))), (F (AND p0 p1 p3)), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) p1 p3)), (F (AND (NOT p0) p3 (NOT p2))), (F (AND p0 p3 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (AND p0 (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p1 (NOT p3))))]
Knowledge based reduction with 56 factoid took 2242 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 8 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-29 02:28:10] [INFO ] Invariant cache hit.
[2024-05-29 02:28:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 02:28:10] [INFO ] Invariant cache hit.
[2024-05-29 02:28:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-29 02:28:10] [INFO ] Invariant cache hit.
[2024-05-29 02:28:10] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 296 ms. Remains : 178/178 places, 163/163 transitions.
Computed a total of 46 stabilizing places and 46 stable transitions
Computed a total of 46 stabilizing places and 46 stable transitions
Detected a total of 46/178 stabilizing places and 46/163 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 38 factoid took 308 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 18) seen :15
Finished Best-First random walk after 4225 steps, including 1 resets, run visited all 3 properties in 7 ms. (steps per millisecond=603 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (NOT (AND p0 p3 p1))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND p0 p1 p3)), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) p1 p3)), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND p0 p3)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 (NOT p3)))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p3)), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p1 (NOT p3))))]
Knowledge based reduction with 38 factoid took 1433 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33220 reset in 222 ms.
Product exploration explored 100000 steps with 33405 reset in 227 ms.
Built C files in :
/tmp/ltsmin2658507165550903151
[2024-05-29 02:28:13] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2658507165550903151
Running compilation step : cd /tmp/ltsmin2658507165550903151;'/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 251 ms.
Running link step : cd /tmp/ltsmin2658507165550903151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2658507165550903151;'/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/stateBased17005134639231378202.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 163/163 transitions.
Applied a total of 0 rules in 2 ms. Remains 178 /178 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2024-05-29 02:28:28] [INFO ] Invariant cache hit.
[2024-05-29 02:28:28] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-29 02:28:28] [INFO ] Invariant cache hit.
[2024-05-29 02:28:29] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-29 02:28:29] [INFO ] Invariant cache hit.
[2024-05-29 02:28:29] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 178/178 places, 163/163 transitions.
Built C files in :
/tmp/ltsmin7702480231735179763
[2024-05-29 02:28:29] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7702480231735179763
Running compilation step : cd /tmp/ltsmin7702480231735179763;'/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 252 ms.
Running link step : cd /tmp/ltsmin7702480231735179763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7702480231735179763;'/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/stateBased9571402639280654164.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 02:28:44] [INFO ] Flatten gal took : 14 ms
[2024-05-29 02:28:44] [INFO ] Flatten gal took : 9 ms
[2024-05-29 02:28:44] [INFO ] Time to serialize gal into /tmp/LTL16350457799744820776.gal : 3 ms
[2024-05-29 02:28:44] [INFO ] Time to serialize properties into /tmp/LTL17367789039855722095.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/LTL16350457799744820776.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13011201711825738194.hoa' '-atoms' '/tmp/LTL17367789039855722095.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/LTL17367789039855722095.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13011201711825738194.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t16, t20, t25, t29, t34, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t65,...406
Computing Next relation with stutter on 416 deadlock states
Detected timeout of ITS tools.
[2024-05-29 02:28:59] [INFO ] Flatten gal took : 9 ms
[2024-05-29 02:28:59] [INFO ] Flatten gal took : 8 ms
[2024-05-29 02:28:59] [INFO ] Time to serialize gal into /tmp/LTL17558121966406957483.gal : 2 ms
[2024-05-29 02:28:59] [INFO ] Time to serialize properties into /tmp/LTL2802611497350305631.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/LTL17558121966406957483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2802611497350305631.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 : !((F(((G("(p81==0)"))||(G(("((p39==0)||(p63==1))")U(X("((p152==0)||(p30==1))")))))||(G("((p30==0)&&(p152==1))")))))
Formula 0 simplified : G(F!"(p81==0)" & F(!"((p39==0)||(p63==1))" R X!"((p152==0)||(p30==1))") & F!"((p30==0)&&(p152==1))")
Reverse transition relation is NOT exact ! Due to transitions t6, t11, t16, t20, t25, t29, t34, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t65,...406
Computing Next relation with stutter on 416 deadlock states
Detected timeout of ITS tools.
[2024-05-29 02:29:14] [INFO ] Flatten gal took : 19 ms
[2024-05-29 02:29:14] [INFO ] Applying decomposition
[2024-05-29 02:29:14] [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/graph16099620794975596762.txt' '-o' '/tmp/graph16099620794975596762.bin' '-w' '/tmp/graph16099620794975596762.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16099620794975596762.bin' '-l' '-1' '-v' '-w' '/tmp/graph16099620794975596762.weights' '-q' '0' '-e' '0.001'
[2024-05-29 02:29:14] [INFO ] Decomposing Gal with order
[2024-05-29 02:29:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 02:29:14] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-29 02:29:14] [INFO ] Flatten gal took : 59 ms
[2024-05-29 02:29:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 02:29:14] [INFO ] Time to serialize gal into /tmp/LTL2376534690750906079.gal : 13 ms
[2024-05-29 02:29:14] [INFO ] Time to serialize properties into /tmp/LTL10674927025006784583.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/LTL2376534690750906079.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10674927025006784583.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((G("(i4.i1.u26.p81==0)"))||(G(("((i1.u11.p39==0)||(i3.u19.p63==1))")U(X("((i9.u49.p152==0)||(i1.u10.p30==1))")))))||(G("((i1.u10...188
Formula 0 simplified : G(F!"(i4.i1.u26.p81==0)" & F(!"((i1.u11.p39==0)||(i3.u19.p63==1))" R X!"((i9.u49.p152==0)||(i1.u10.p30==1))") & F!"((i1.u10.p30==0)&...175
Reverse transition relation is NOT exact ! Due to transitions t43, t89, t131, t133, i0.i1.t129, i0.i1.u5.t136, i0.i1.u9.t130, i0.i2.t100, i0.i2.u20.t96, i1...686
Computing Next relation with stutter on 416 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10844538739467803413
[2024-05-29 02:29:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10844538739467803413
Running compilation step : cd /tmp/ltsmin10844538739467803413;'/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 241 ms.
Running link step : cd /tmp/ltsmin10844538739467803413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10844538739467803413;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[](((LTLAPp1==true) U X((LTLAPp2==true))))||[]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 99842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1 U X(p2)))||G(p3))))'
Found a Lengthening insensitive property : ShieldIIPt-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Support contains 5 out of 182 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 182/182 places, 167/167 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 181 transition count 130
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 145 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 144 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 74 place count 144 transition count 107
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 118 place count 122 transition count 107
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 120 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 120 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 122 place count 120 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 119 transition count 104
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 208 place count 77 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 209 place count 77 transition count 61
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 4 with 2 rules applied. Total rules applied 211 place count 76 transition count 60
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 227 place count 68 transition count 65
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 66 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 231 place count 64 transition count 63
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 231 place count 64 transition count 62
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 233 place count 63 transition count 62
Applied a total of 233 rules in 26 ms. Remains 63 /182 variables (removed 119) and now considering 62/167 (removed 105) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-29 02:29:45] [INFO ] Computed 26 invariants in 2 ms
[2024-05-29 02:29:45] [INFO ] Implicit Places using invariants in 59 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 62/182 places, 62/167 transitions.
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 2 place count 61 transition count 61
Applied a total of 2 rules in 3 ms. Remains 61 /62 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-05-29 02:29:45] [INFO ] Computed 25 invariants in 0 ms
[2024-05-29 02:29:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 02:29:45] [INFO ] Invariant cache hit.
[2024-05-29 02:29:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:29:45] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 61/182 places, 61/167 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 197 ms. Remains : 61/182 places, 61/167 transitions.
Running random walk in product with property : ShieldIIPt-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 p3 (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1, 2} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(AND p0 p3 p1), acceptance={1} source=0 dest: 2}, { cond=(AND (NOT p0) p3 p1), acceptance={0, 1} source=0 dest: 2}, { cond=(AND p0 (NOT p3) p1), acceptance={1, 2} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1), acceptance={0, 1, 2} source=0 dest: 2}], [{ cond=(AND p0 p3 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={2} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 2} source=1 dest: 0}, { cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 2}], [{ cond=(AND p0 p3 (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) p3 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p1) (NOT p2)), acceptance={1, 2} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p0) p3 p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p1 (NOT p2)), acceptance={0, 1, 2} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s27 0), p3:(AND (EQ s14 0) (EQ s48 1)), p1:(OR (EQ s17 0) (EQ s23 1)), p2:(OR (EQ s48 0) (EQ s14 1))], nbAcceptance=3, 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 27294 reset in 364 ms.
Product exploration explored 100000 steps with 27226 reset in 329 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/61 stabilizing places and 7/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p0 p3 p1 (NOT p2))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3))))]
Knowledge based reduction with 30 factoid took 2484 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 32 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=27 ) properties (out of 24) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-29 02:29:49] [INFO ] Invariant cache hit.
[2024-05-29 02:29:49] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-29 02:29:49] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2024-05-29 02:29:49] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND p0 (NOT p3) p1 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (G (NOT (AND p0 p1 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (G (NOT (AND p0 (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (G (NOT (AND p0 (NOT p1) (NOT p3) (NOT p2))))]
False Knowledge obtained : [(X (AND p0 p3 p1 (NOT p2))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 p3 (NOT p2))), (X (NOT (AND p0 p3 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND p0 p3 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p3))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND p0 p3)), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) p3)), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (AND p0 p1 p3 (NOT p2))), (F (AND p0 p1 p3)), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) p1 p3)), (F (AND (NOT p0) p3 (NOT p2))), (F (AND p0 p3 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (AND p0 (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p1 (NOT p3))))]
Knowledge based reduction with 36 factoid took 3742 ms. Reduced automaton from 3 states, 32 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-29 02:29:53] [INFO ] Invariant cache hit.
[2024-05-29 02:29:53] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 02:29:53] [INFO ] Invariant cache hit.
[2024-05-29 02:29:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:29:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-29 02:29:53] [INFO ] Invariant cache hit.
[2024-05-29 02:29:53] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 61/61 places, 61/61 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Detected a total of 7/61 stabilizing places and 7/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 18 factoid took 1765 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 18) seen :16
Finished Best-First random walk after 94 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1 p2), (X (NOT (AND (NOT p0) p3 p1))), (X (NOT (AND (NOT p0) p3 (NOT p1)))), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT (AND (NOT p0) p3))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p3) p1)), (X (NOT (AND (NOT p0) (NOT p3) p1))), (X (AND p0 p3 p1)), (X (NOT (AND p0 p3 p1))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 (NOT p3) p1)), (X (NOT (AND p0 (NOT p3) p1))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 (NOT p3)))), (X (AND p0 p3)), (X (NOT (AND p0 p3))), (X (AND p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (X (AND (NOT p0) p3 p1))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (AND (NOT p0) (NOT p3) p1))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (AND p0 p3 p1))), (X (X (NOT (AND p0 p3 p1)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p0 (NOT p3) p1))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (AND p0 p3))), (X (X (NOT (AND p0 p3)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 p1 p3)), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) p1 p3)), (F (AND p0 (NOT p1) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p3))), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p1) (NOT p3))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND p0 p3)), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND p0 (NOT p3)))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) p3)), (F (AND (NOT p0) p1 (NOT p3))), (F (NOT (AND p0 p1 (NOT p3))))]
Knowledge based reduction with 18 factoid took 2424 ms. Reduced automaton from 3 states, 22 edges and 4 AP (stutter sensitive) to 3 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 27348 reset in 315 ms.
Product exploration explored 100000 steps with 27459 reset in 230 ms.
Built C files in :
/tmp/ltsmin5656009522916396893
[2024-05-29 02:29:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5656009522916396893
Running compilation step : cd /tmp/ltsmin5656009522916396893;'/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 127 ms.
Running link step : cd /tmp/ltsmin5656009522916396893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5656009522916396893;'/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/stateBased15769750409221718660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 61 /61 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-29 02:30:14] [INFO ] Invariant cache hit.
[2024-05-29 02:30:14] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 02:30:14] [INFO ] Invariant cache hit.
[2024-05-29 02:30:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 02:30:14] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 02:30:14] [INFO ] Invariant cache hit.
[2024-05-29 02:30:14] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 61/61 places, 61/61 transitions.
Built C files in :
/tmp/ltsmin7470506265700118129
[2024-05-29 02:30:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7470506265700118129
Running compilation step : cd /tmp/ltsmin7470506265700118129;'/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 136 ms.
Running link step : cd /tmp/ltsmin7470506265700118129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7470506265700118129;'/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/stateBased9396459627019889905.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 02:30:29] [INFO ] Flatten gal took : 5 ms
[2024-05-29 02:30:29] [INFO ] Flatten gal took : 4 ms
[2024-05-29 02:30:29] [INFO ] Time to serialize gal into /tmp/LTL11519828167695881930.gal : 2 ms
[2024-05-29 02:30:29] [INFO ] Time to serialize properties into /tmp/LTL5089985037671400078.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/LTL11519828167695881930.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2890755819119122173.hoa' '-atoms' '/tmp/LTL5089985037671400078.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/LTL5089985037671400078.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2890755819119122173.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t135, t43, t85, t105, t121.t122, t120.t129.t131.t133, t119.t162.t136.t115.t118, t87.t89, t...638
Computing Next relation with stutter on 416 deadlock states
32 unique states visited
5 strongly connected components in search stack
95 transitions explored
18 items max in DFS search stack
643 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.44999,215448,1,0,965,825644,230,1100,2181,1.74104e+06,2549
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property ShieldIIPt-PT-003B-LTLCardinality-13 finished in 53123 ms.
FORMULA ShieldIIPt-PT-003B-LTLCardinality-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-29 02:30:38] [INFO ] Flatten gal took : 7 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 161973 ms.

BK_STOP 1716949839194

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="LTLCardinality"
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 ShieldIIPt-PT-003B, examination is LTLCardinality"
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-171683788600137"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003B.tgz
mv ShieldIIPt-PT-003B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;