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-171683788900247.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 ShieldPPPs-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-171683788900247
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 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 52K 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 ShieldPPPs-PT-003B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716960902202

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=ShieldPPPs-PT-003B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 05:35:04] [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 05:35:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:35:04] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-29 05:35:04] [INFO ] Transformed 207 places.
[2024-05-29 05:35:04] [INFO ] Transformed 192 transitions.
[2024-05-29 05:35:04] [INFO ] Found NUPN structural information;
[2024-05-29 05:35:04] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 190 transition count 175
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 190 transition count 175
Applied a total of 34 rules in 39 ms. Remains 190 /207 variables (removed 17) and now considering 175/192 (removed 17) transitions.
// Phase 1: matrix 175 rows 190 cols
[2024-05-29 05:35:04] [INFO ] Computed 34 invariants in 15 ms
[2024-05-29 05:35:04] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 05:35:04] [INFO ] Invariant cache hit.
[2024-05-29 05:35:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
[2024-05-29 05:35:05] [INFO ] Invariant cache hit.
[2024-05-29 05:35:05] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 190/207 places, 175/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 651 ms. Remains : 190/207 places, 175/192 transitions.
Support contains 18 out of 190 places after structural reductions.
[2024-05-29 05:35:05] [INFO ] Flatten gal took : 38 ms
[2024-05-29 05:35:05] [INFO ] Flatten gal took : 16 ms
[2024-05-29 05:35:05] [INFO ] Input system was already deterministic with 175 transitions.
Finished random walk after 1023 steps, including 1 resets, run visited all 11 properties in 63 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 39 stabilizing places and 39 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' '!(X(X(G(p0))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 185 transition count 170
Applied a total of 10 rules in 36 ms. Remains 185 /190 variables (removed 5) and now considering 170/175 (removed 5) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 05:35:05] [INFO ] Computed 34 invariants in 7 ms
[2024-05-29 05:35:05] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 05:35:05] [INFO ] Invariant cache hit.
[2024-05-29 05:35:06] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-29 05:35:06] [INFO ] Invariant cache hit.
[2024-05-29 05:35:06] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 170/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 185/190 places, 170/175 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 290 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-01 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: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s164 0) (EQ s53 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 2 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-01 finished in 724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 189 transition count 174
Applied a total of 2 rules in 12 ms. Remains 189 /190 variables (removed 1) and now considering 174/175 (removed 1) transitions.
// Phase 1: matrix 174 rows 189 cols
[2024-05-29 05:35:06] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:35:06] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 05:35:06] [INFO ] Invariant cache hit.
[2024-05-29 05:35:06] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-29 05:35:06] [INFO ] Invariant cache hit.
[2024-05-29 05:35:06] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/190 places, 174/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 189/190 places, 174/175 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s61 0) (EQ s107 1)), p0:(OR (EQ s70 0) (EQ s31 1)), p2:(EQ s73 1), p3:(OR (EQ s161 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 193 reset in 356 ms.
Product exploration explored 100000 steps with 189 reset in 303 ms.
Computed a total of 38 stabilizing places and 38 stable transitions
Computed a total of 38 stabilizing places and 38 stable transitions
Detected a total of 38/189 stabilizing places and 38/174 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 18 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:35:08] [INFO ] Invariant cache hit.
[2024-05-29 05:35:08] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:35:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-29 05:35:08] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:35:08] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 3 ms to minimize.
[2024-05-29 05:35:08] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-29 05:35:08] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 1 ms to minimize.
[2024-05-29 05:35:08] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 05:35:08] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:35:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 354 ms
[2024-05-29 05:35:08] [INFO ] After 416ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-29 05:35:08] [INFO ] After 494ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 174/174 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 189 transition count 153
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 42 place count 168 transition count 137
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 74 place count 152 transition count 137
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 151 transition count 136
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 151 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 76 place count 151 transition count 135
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 78 place count 150 transition count 135
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 174 place count 102 transition count 87
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 2 with 23 rules applied. Total rules applied 197 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 101 transition count 86
Applied a total of 198 rules in 33 ms. Remains 101 /189 variables (removed 88) and now considering 86/174 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 101/189 places, 86/174 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1763197 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :{}
Probabilistic random walk after 1763197 steps, saw 319839 distinct states, run finished after 3002 ms. (steps per millisecond=587 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 05:35:11] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 05:35:11] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:35:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 5 ms returned sat
[2024-05-29 05:35:11] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-29 05:35:11] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 159 ms
[2024-05-29 05:35:12] [INFO ] After 203ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 05:35:12] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 05:35:12] [INFO ] Invariant cache hit.
[2024-05-29 05:35:12] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 05:35:12] [INFO ] Invariant cache hit.
[2024-05-29 05:35:12] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-29 05:35:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 05:35:12] [INFO ] Invariant cache hit.
[2024-05-29 05:35:12] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 05:35:12] [INFO ] Invariant cache hit.
[2024-05-29 05:35:12] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:35:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 9 ms returned sat
[2024-05-29 05:35:12] [INFO ] [Nat]Absence check using 31 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-29 05:35:12] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 05:35:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 186 ms
[2024-05-29 05:35:12] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 05:35:12] [INFO ] After 285ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 9 factoid took 273 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 174/174 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 188 transition count 153
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 168 transition count 153
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 168 transition count 137
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 152 transition count 137
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 162 place count 107 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 164 place count 105 transition count 90
Applied a total of 164 rules in 25 ms. Remains 105 /189 variables (removed 84) and now considering 90/174 (removed 84) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 05:35:13] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 05:35:13] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 05:35:13] [INFO ] Invariant cache hit.
[2024-05-29 05:35:13] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-29 05:35:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:35:13] [INFO ] Invariant cache hit.
[2024-05-29 05:35:13] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/189 places, 90/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 105/189 places, 90/174 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 123 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 38 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:35:14] [INFO ] Invariant cache hit.
[2024-05-29 05:35:14] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:35:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 05:35:14] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:35:14] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:35:14] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-29 05:35:14] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-29 05:35:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2024-05-29 05:35:14] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-29 05:35:14] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 16 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1879265 steps, run timeout after 3004 ms. (steps per millisecond=625 ) properties seen :{}
Probabilistic random walk after 1879265 steps, saw 332969 distinct states, run finished after 3004 ms. (steps per millisecond=625 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 05:35:17] [INFO ] Computed 34 invariants in 5 ms
[2024-05-29 05:35:17] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:35:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-29 05:35:17] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 05:35:17] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:35:17] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 05:35:17] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:35:17] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:35:17] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-29 05:35:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 177 ms
[2024-05-29 05:35:17] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-29 05:35:17] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 05:35:17] [INFO ] Invariant cache hit.
[2024-05-29 05:35:17] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 05:35:17] [INFO ] Invariant cache hit.
[2024-05-29 05:35:17] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-29 05:35:17] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:35:17] [INFO ] Invariant cache hit.
[2024-05-29 05:35:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 246 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 05:35:17] [INFO ] Invariant cache hit.
[2024-05-29 05:35:17] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:35:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-29 05:35:17] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 05:35:18] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:35:18] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 05:35:18] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-29 05:35:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 87 ms
[2024-05-29 05:35:18] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 05:35:18] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 12 factoid took 292 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 185 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 415 reset in 240 ms.
Product exploration explored 100000 steps with 424 reset in 306 ms.
Built C files in :
/tmp/ltsmin6671916337824246539
[2024-05-29 05:35:19] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 05:35:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:35:19] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 05:35:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:35:19] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 05:35:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:35:19] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6671916337824246539
Running compilation step : cd /tmp/ltsmin6671916337824246539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 327 ms.
Running link step : cd /tmp/ltsmin6671916337824246539;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin6671916337824246539;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12287401231755505296.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 14 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 05:35:34] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:35:34] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-29 05:35:34] [INFO ] Invariant cache hit.
[2024-05-29 05:35:34] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-29 05:35:34] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:35:34] [INFO ] Invariant cache hit.
[2024-05-29 05:35:35] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 105/105 places, 90/90 transitions.
Built C files in :
/tmp/ltsmin154864017995194679
[2024-05-29 05:35:35] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 05:35:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:35:35] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 05:35:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:35:35] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 05:35:35] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:35:35] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin154864017995194679
Running compilation step : cd /tmp/ltsmin154864017995194679;'/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 206 ms.
Running link step : cd /tmp/ltsmin154864017995194679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin154864017995194679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10664317061381426510.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:35:50] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:35:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:35:50] [INFO ] Time to serialize gal into /tmp/LTL6236744785239877084.gal : 3 ms
[2024-05-29 05:35:50] [INFO ] Time to serialize properties into /tmp/LTL8736337823720604484.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/LTL6236744785239877084.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17580123671101333387.hoa' '-atoms' '/tmp/LTL8736337823720604484.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/LTL8736337823720604484.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17580123671101333387.hoa
Detected timeout of ITS tools.
[2024-05-29 05:36:05] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:36:05] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:36:05] [INFO ] Time to serialize gal into /tmp/LTL1369215356016888069.gal : 2 ms
[2024-05-29 05:36:05] [INFO ] Time to serialize properties into /tmp/LTL17813996638374624741.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1369215356016888069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17813996638374624741.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 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||((F(G("((p173==0)||(p3==1))")))&&("((p76==0)||(p31==1)...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
Detected timeout of ITS tools.
[2024-05-29 05:36:20] [INFO ] Flatten gal took : 12 ms
[2024-05-29 05:36:20] [INFO ] Applying decomposition
[2024-05-29 05:36:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11052410573458188513.txt' '-o' '/tmp/graph11052410573458188513.bin' '-w' '/tmp/graph11052410573458188513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11052410573458188513.bin' '-l' '-1' '-v' '-w' '/tmp/graph11052410573458188513.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:36:20] [INFO ] Decomposing Gal with order
[2024-05-29 05:36:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:36:20] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-29 05:36:20] [INFO ] Flatten gal took : 38 ms
[2024-05-29 05:36:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2024-05-29 05:36:20] [INFO ] Time to serialize gal into /tmp/LTL8719891357002391771.gal : 3 ms
[2024-05-29 05:36:20] [INFO ] Time to serialize properties into /tmp/LTL3553761108477657665.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/LTL8719891357002391771.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3553761108477657665.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...254
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((i5.i0.u12.p76==0)||(i2.i1.u6.p31==1))")U("((i2.i1.u11.p66==0)||(i5.i0.u21.p114==1))"))||(F("(i5.i0.u13.p79==1)")))||((F(G...244
Formula 0 simplified : XF((!"((i5.i0.u12.p76==0)||(i2.i1.u6.p31==1))" R !"((i2.i1.u11.p66==0)||(i5.i0.u21.p114==1))") & G!"(i5.i0.u13.p79==1)" & (!"((i5.i0...231
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16575489950080813109
[2024-05-29 05:36:35] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16575489950080813109
Running compilation step : cd /tmp/ltsmin16575489950080813109;'/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 171 ms.
Running link step : cd /tmp/ltsmin16575489950080813109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16575489950080813109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||(<>([]((LTLAPp3==true)))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 104216 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(F((X(p1)||p0))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 187 transition count 172
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 187 transition count 172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 186 transition count 171
Applied a total of 8 rules in 5 ms. Remains 186 /190 variables (removed 4) and now considering 171/175 (removed 4) transitions.
// Phase 1: matrix 171 rows 186 cols
[2024-05-29 05:36:50] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:36:50] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-29 05:36:50] [INFO ] Invariant cache hit.
[2024-05-29 05:36:50] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-05-29 05:36:50] [INFO ] Invariant cache hit.
[2024-05-29 05:36:51] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/190 places, 171/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 186/190 places, 171/175 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s119 0) (EQ s152 1)), p1:(AND (NEQ s164 0) (NEQ s169 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 198 ms.
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-003B-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-09 finished in 875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p0) U p1)))))'
Support contains 2 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 185 transition count 170
Applied a total of 10 rules in 12 ms. Remains 185 /190 variables (removed 5) and now considering 170/175 (removed 5) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 05:36:51] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:36:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 05:36:51] [INFO ] Invariant cache hit.
[2024-05-29 05:36:51] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-29 05:36:51] [INFO ] Invariant cache hit.
[2024-05-29 05:36:51] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 170/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 185/190 places, 170/175 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s100 1), p0:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-10 finished in 590 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 186 transition count 171
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 186 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 185 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 185 transition count 170
Applied a total of 10 rules in 12 ms. Remains 185 /190 variables (removed 5) and now considering 170/175 (removed 5) transitions.
[2024-05-29 05:36:52] [INFO ] Invariant cache hit.
[2024-05-29 05:36:52] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 05:36:52] [INFO ] Invariant cache hit.
[2024-05-29 05:36:52] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-29 05:36:52] [INFO ] Invariant cache hit.
[2024-05-29 05:36:52] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/190 places, 170/175 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 185/190 places, 170/175 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s19 0) (EQ s16 1)), p1:(OR (EQ s139 0) (EQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24949 reset in 128 ms.
Product exploration explored 100000 steps with 24993 reset in 141 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 823 steps, including 1 resets, run visited all 3 properties in 16 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 4 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-29 05:36:54] [INFO ] Invariant cache hit.
[2024-05-29 05:36:54] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 05:36:54] [INFO ] Invariant cache hit.
[2024-05-29 05:36:54] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-29 05:36:54] [INFO ] Invariant cache hit.
[2024-05-29 05:36:54] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 125 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 3087 steps, including 5 resets, run visited all 3 properties in 16 ms. (steps per millisecond=192 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24985 reset in 132 ms.
Product exploration explored 100000 steps with 24900 reset in 135 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 345 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 185 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 21 place count 185 transition count 171
Deduced a syphon composed of 29 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 88 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 111 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 134 place count 162 transition count 148
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 134 rules in 25 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2024-05-29 05:36:56] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2024-05-29 05:36:56] [INFO ] Computed 34 invariants in 5 ms
[2024-05-29 05:36:56] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 148/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 135 ms. Remains : 162/185 places, 148/170 transitions.
Built C files in :
/tmp/ltsmin3185712536028530103
[2024-05-29 05:36:56] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3185712536028530103
Running compilation step : cd /tmp/ltsmin3185712536028530103;'/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 276 ms.
Running link step : cd /tmp/ltsmin3185712536028530103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3185712536028530103;'/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/stateBased13603478882754759613.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 8 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 05:37:12] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:37:12] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 05:37:12] [INFO ] Invariant cache hit.
[2024-05-29 05:37:12] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 05:37:12] [INFO ] Invariant cache hit.
[2024-05-29 05:37:12] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 185/185 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin13857704099341272906
[2024-05-29 05:37:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13857704099341272906
Running compilation step : cd /tmp/ltsmin13857704099341272906;'/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 249 ms.
Running link step : cd /tmp/ltsmin13857704099341272906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13857704099341272906;'/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/stateBased14866943448386765013.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:37:27] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:37:27] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:37:27] [INFO ] Time to serialize gal into /tmp/LTL15500517734339802017.gal : 2 ms
[2024-05-29 05:37:27] [INFO ] Time to serialize properties into /tmp/LTL1855712787307955261.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/LTL15500517734339802017.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2639048476139597777.hoa' '-atoms' '/tmp/LTL1855712787307955261.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/LTL1855712787307955261.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2639048476139597777.hoa
Detected timeout of ITS tools.
[2024-05-29 05:37:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:37:42] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:37:42] [INFO ] Time to serialize gal into /tmp/LTL7519196949772041712.gal : 2 ms
[2024-05-29 05:37:42] [INFO ] Time to serialize properties into /tmp/LTL12473888104829966869.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/LTL7519196949772041712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12473888104829966869.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((p19==0)||(p16==1))"))U(X(X("((p153==0)||(p24==1))"))))))
Formula 0 simplified : F(G!"((p19==0)||(p16==1))" R XX!"((p153==0)||(p24==1))")
Detected timeout of ITS tools.
[2024-05-29 05:37:57] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:37:57] [INFO ] Applying decomposition
[2024-05-29 05:37:57] [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/graph5185731211083255548.txt' '-o' '/tmp/graph5185731211083255548.bin' '-w' '/tmp/graph5185731211083255548.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5185731211083255548.bin' '-l' '-1' '-v' '-w' '/tmp/graph5185731211083255548.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:37:57] [INFO ] Decomposing Gal with order
[2024-05-29 05:37:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:37:57] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 05:37:57] [INFO ] Flatten gal took : 16 ms
[2024-05-29 05:37:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 05:37:57] [INFO ] Time to serialize gal into /tmp/LTL15038753792125237212.gal : 11 ms
[2024-05-29 05:37:57] [INFO ] Time to serialize properties into /tmp/LTL7161316935055796540.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15038753792125237212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7161316935055796540.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 : !((G((F("((i0.i2.u7.p19==0)||(i0.i1.u5.p16==1))"))U(X(X("((i10.i0.u55.p153==0)||(i3.i0.u9.p24==1))"))))))
Formula 0 simplified : F(G!"((i0.i2.u7.p19==0)||(i0.i1.u5.p16==1))" R XX!"((i10.i0.u55.p153==0)||(i3.i0.u9.p24==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1689492960459398183
[2024-05-29 05:38:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1689492960459398183
Running compilation step : cd /tmp/ltsmin1689492960459398183;'/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 258 ms.
Running link step : cd /tmp/ltsmin1689492960459398183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin1689492960459398183;'/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)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 95939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)||F(p2)||(p0&&F(G(p3)))))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-06
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 189 transition count 154
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 169 transition count 154
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 40 place count 169 transition count 138
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 153 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 152 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 152 transition count 137
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 152 transition count 136
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 76 place count 151 transition count 136
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 164 place count 107 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 166 place count 105 transition count 90
Applied a total of 166 rules in 24 ms. Remains 105 /190 variables (removed 85) and now considering 90/175 (removed 85) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 05:38:28] [INFO ] Computed 34 invariants in 0 ms
[2024-05-29 05:38:28] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 05:38:28] [INFO ] Invariant cache hit.
[2024-05-29 05:38:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-29 05:38:28] [INFO ] Invariant cache hit.
[2024-05-29 05:38:28] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 105/190 places, 90/175 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 260 ms. Remains : 105/190 places, 90/175 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0 (NOT p2) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s34 0) (EQ s63 1)), p0:(OR (EQ s38 0) (EQ s17 1)), p2:(EQ s40 1), p3:(OR (EQ s90 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 416 reset in 206 ms.
Product exploration explored 100000 steps with 421 reset in 298 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 129 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:38:29] [INFO ] Invariant cache hit.
[2024-05-29 05:38:29] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:38:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-29 05:38:29] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:38:29] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:38:29] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-29 05:38:29] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 05:38:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 113 ms
[2024-05-29 05:38:29] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 05:38:29] [INFO ] After 201ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 14 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1716254 steps, run timeout after 3001 ms. (steps per millisecond=571 ) properties seen :{}
Probabilistic random walk after 1716254 steps, saw 312670 distinct states, run finished after 3001 ms. (steps per millisecond=571 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 05:38:32] [INFO ] Computed 34 invariants in 4 ms
[2024-05-29 05:38:32] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:38:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-29 05:38:32] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 05:38:32] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:38:33] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 05:38:33] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:38:33] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 05:38:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 118 ms
[2024-05-29 05:38:33] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 05:38:33] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 05:38:33] [INFO ] Invariant cache hit.
[2024-05-29 05:38:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 05:38:33] [INFO ] Invariant cache hit.
[2024-05-29 05:38:33] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-29 05:38:33] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-29 05:38:33] [INFO ] Invariant cache hit.
[2024-05-29 05:38:33] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 250 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 05:38:33] [INFO ] Invariant cache hit.
[2024-05-29 05:38:33] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:38:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-29 05:38:33] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 05:38:33] [INFO ] After 35ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:38:33] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-29 05:38:33] [INFO ] After 90ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-29 05:38:33] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0 (NOT p2) p3), (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 9 factoid took 275 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 8 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 05:38:34] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:38:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 05:38:34] [INFO ] Invariant cache hit.
[2024-05-29 05:38:34] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 05:38:34] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:38:34] [INFO ] Invariant cache hit.
[2024-05-29 05:38:34] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 105/105 places, 90/90 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Detected a total of 8/105 stabilizing places and 8/90 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 115 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 37 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 05:38:34] [INFO ] Invariant cache hit.
[2024-05-29 05:38:34] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:38:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 05:38:34] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:38:34] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-29 05:38:34] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:38:34] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-29 05:38:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 111 ms
[2024-05-29 05:38:34] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-29 05:38:34] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 90/90 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 105 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 104 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 102 transition count 87
Partial Free-agglomeration rule applied 21 times.
Drop transitions removed 21 transitions
Iterating global reduction 2 with 21 rules applied. Total rules applied 27 place count 102 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 101 transition count 86
Applied a total of 28 rules in 20 ms. Remains 101 /105 variables (removed 4) and now considering 86/90 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 101/105 places, 86/90 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1894709 steps, run timeout after 3001 ms. (steps per millisecond=631 ) properties seen :{}
Probabilistic random walk after 1894709 steps, saw 335544 distinct states, run finished after 3001 ms. (steps per millisecond=631 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 101 cols
[2024-05-29 05:38:38] [INFO ] Computed 34 invariants in 5 ms
[2024-05-29 05:38:38] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:38:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-29 05:38:38] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 05:38:38] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:38:38] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 3 ms to minimize.
[2024-05-29 05:38:38] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 05:38:38] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:38:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 134 ms
[2024-05-29 05:38:38] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-29 05:38:38] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 101/101 places, 86/86 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2024-05-29 05:38:38] [INFO ] Invariant cache hit.
[2024-05-29 05:38:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 05:38:38] [INFO ] Invariant cache hit.
[2024-05-29 05:38:38] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-29 05:38:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 05:38:38] [INFO ] Invariant cache hit.
[2024-05-29 05:38:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 101/101 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 101 /101 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 05:38:38] [INFO ] Invariant cache hit.
[2024-05-29 05:38:38] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 05:38:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-29 05:38:38] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 05:38:38] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 05:38:38] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 05:38:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-29 05:38:38] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-29 05:38:38] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p2) (NOT p3))), (F p2), (F (AND p0 (NOT p1) (NOT p2) (NOT p3)))]
Knowledge based reduction with 12 factoid took 249 ms. Reduced automaton from 4 states, 9 edges and 4 AP (stutter insensitive) to 4 states, 9 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 165 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 421 reset in 236 ms.
Product exploration explored 100000 steps with 426 reset in 242 ms.
Built C files in :
/tmp/ltsmin3941949119920881336
[2024-05-29 05:38:39] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 05:38:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:39] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 05:38:39] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:39] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 05:38:39] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:39] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3941949119920881336
Running compilation step : cd /tmp/ltsmin3941949119920881336;'/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 194 ms.
Running link step : cd /tmp/ltsmin3941949119920881336;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3941949119920881336;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4656631492375619749.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 90/90 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 105 cols
[2024-05-29 05:38:55] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:38:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 05:38:55] [INFO ] Invariant cache hit.
[2024-05-29 05:38:55] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-05-29 05:38:55] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:38:55] [INFO ] Invariant cache hit.
[2024-05-29 05:38:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 105/105 places, 90/90 transitions.
Built C files in :
/tmp/ltsmin11092355183018821
[2024-05-29 05:38:55] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-29 05:38:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:55] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-29 05:38:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:55] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-29 05:38:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:55] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11092355183018821
Running compilation step : cd /tmp/ltsmin11092355183018821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 193 ms.
Running link step : cd /tmp/ltsmin11092355183018821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11092355183018821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4070879203828728126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:39:10] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:39:10] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:39:10] [INFO ] Time to serialize gal into /tmp/LTL3370165130743707322.gal : 1 ms
[2024-05-29 05:39:10] [INFO ] Time to serialize properties into /tmp/LTL14198012739239231327.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/LTL3370165130743707322.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12571923960533772911.hoa' '-atoms' '/tmp/LTL14198012739239231327.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...319
Loading property file /tmp/LTL14198012739239231327.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12571923960533772911.hoa
Detected timeout of ITS tools.
[2024-05-29 05:39:25] [INFO ] Flatten gal took : 4 ms
[2024-05-29 05:39:25] [INFO ] Flatten gal took : 3 ms
[2024-05-29 05:39:25] [INFO ] Time to serialize gal into /tmp/LTL3179221912836990319.gal : 1 ms
[2024-05-29 05:39:25] [INFO ] Time to serialize properties into /tmp/LTL3323031463847454908.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/LTL3179221912836990319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3323031463847454908.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||((F(G("((p173==0)||(p3==1))")))&&("((p76==0)||(p31==1)...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
Detected timeout of ITS tools.
[2024-05-29 05:39:40] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:39:40] [INFO ] Applying decomposition
[2024-05-29 05:39:40] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1490844615658399958.txt' '-o' '/tmp/graph1490844615658399958.bin' '-w' '/tmp/graph1490844615658399958.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1490844615658399958.bin' '-l' '-1' '-v' '-w' '/tmp/graph1490844615658399958.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:39:40] [INFO ] Decomposing Gal with order
[2024-05-29 05:39:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:39:40] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-29 05:39:40] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 2 ms.
[2024-05-29 05:39:40] [INFO ] Time to serialize gal into /tmp/LTL15431358165509253280.gal : 2 ms
[2024-05-29 05:39:40] [INFO ] Time to serialize properties into /tmp/LTL7938099477913379987.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/LTL15431358165509253280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7938099477913379987.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 : !((X(G(((("((i3.i0.u12.p76==0)||(i1.u6.p31==1))")U("((i1.u11.p66==0)||(i3.i1.u21.p114==1))"))||(F("(i3.i0.u13.p79==1)")))||((F(G("((i8...235
Formula 0 simplified : XF((!"((i3.i0.u12.p76==0)||(i1.u6.p31==1))" R !"((i1.u11.p66==0)||(i3.i1.u21.p114==1))") & G!"(i3.i0.u13.p79==1)" & (!"((i3.i0.u12.p...222
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13927422437988685663
[2024-05-29 05:39:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13927422437988685663
Running compilation step : cd /tmp/ltsmin13927422437988685663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin13927422437988685663;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13927422437988685663;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||(<>([]((LTLAPp3==true)))&&(LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-06 finished in 102785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(X(p1)))))'
Found a Lengthening insensitive property : ShieldPPPs-PT-003B-LTLCardinality-13
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 190 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 190/190 places, 175/175 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 189 transition count 152
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 167 transition count 152
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 167 transition count 136
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 151 transition count 136
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 147 transition count 132
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 147 transition count 132
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 84 place count 147 transition count 129
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 144 transition count 129
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 182 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 96 transition count 81
Applied a total of 184 rules in 23 ms. Remains 96 /190 variables (removed 94) and now considering 81/175 (removed 94) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 05:40:11] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 05:40:11] [INFO ] Invariant cache hit.
[2024-05-29 05:40:11] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-29 05:40:11] [INFO ] Invariant cache hit.
[2024-05-29 05:40:11] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 96/190 places, 81/175 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 283 ms. Remains : 96/190 places, 81/175 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s4 1)), p1:(OR (EQ s69 0) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24838 reset in 148 ms.
Product exploration explored 100000 steps with 25027 reset in 159 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 519 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=129 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 05:40:13] [INFO ] Invariant cache hit.
[2024-05-29 05:40:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 05:40:13] [INFO ] Invariant cache hit.
[2024-05-29 05:40:13] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-29 05:40:13] [INFO ] Invariant cache hit.
[2024-05-29 05:40:13] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 220 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 75 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 546 steps, including 2 resets, run visited all 3 properties in 9 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 301 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24985 reset in 157 ms.
Product exploration explored 100000 steps with 25068 reset in 170 ms.
Applying partial POR strategy [false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 288 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 5 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 05:40:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:15] [INFO ] Invariant cache hit.
[2024-05-29 05:40:15] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin12304806455051562897
[2024-05-29 05:40:15] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12304806455051562897
Running compilation step : cd /tmp/ltsmin12304806455051562897;'/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 174 ms.
Running link step : cd /tmp/ltsmin12304806455051562897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin12304806455051562897;'/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/stateBased18270405592202199014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 05:40:30] [INFO ] Invariant cache hit.
[2024-05-29 05:40:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 05:40:30] [INFO ] Invariant cache hit.
[2024-05-29 05:40:30] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-29 05:40:30] [INFO ] Invariant cache hit.
[2024-05-29 05:40:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 207 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin888332647608557935
[2024-05-29 05:40:30] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin888332647608557935
Running compilation step : cd /tmp/ltsmin888332647608557935;'/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 164 ms.
Running link step : cd /tmp/ltsmin888332647608557935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin888332647608557935;'/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/stateBased14027464622619389324.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:40:45] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:40:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 05:40:45] [INFO ] Time to serialize gal into /tmp/LTL13327674183302198081.gal : 1 ms
[2024-05-29 05:40:45] [INFO ] Time to serialize properties into /tmp/LTL16120097618006345182.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/LTL13327674183302198081.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12216855500490842248.hoa' '-atoms' '/tmp/LTL16120097618006345182.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/LTL16120097618006345182.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12216855500490842248.hoa
Reverse transition relation is NOT exact ! Due to transitions t0.t119, t2.t113, t4, t5, t7, t8, t10, t12, t13.t92, t14.t89, t15.t86, t17, t18, t20, t21, t2...521
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
[2024-05-29 05:41:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:41:00] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:41:00] [INFO ] Time to serialize gal into /tmp/LTL2487508517371914197.gal : 1 ms
[2024-05-29 05:41:00] [INFO ] Time to serialize properties into /tmp/LTL15262258557163240558.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/LTL2487508517371914197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15262258557163240558.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((p19==0)||(p16==1))"))U(X(X("((p153==0)||(p24==1))"))))))
Formula 0 simplified : F(G!"((p19==0)||(p16==1))" R XX!"((p153==0)||(p24==1))")
Detected timeout of ITS tools.
[2024-05-29 05:41:16] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:41:16] [INFO ] Applying decomposition
[2024-05-29 05:41:16] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17540244359876177160.txt' '-o' '/tmp/graph17540244359876177160.bin' '-w' '/tmp/graph17540244359876177160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17540244359876177160.bin' '-l' '-1' '-v' '-w' '/tmp/graph17540244359876177160.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:41:16] [INFO ] Decomposing Gal with order
[2024-05-29 05:41:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:41:16] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-29 05:41:16] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:41:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 2 ms.
[2024-05-29 05:41:16] [INFO ] Time to serialize gal into /tmp/LTL10151878587159071882.gal : 1 ms
[2024-05-29 05:41:16] [INFO ] Time to serialize properties into /tmp/LTL5854771488655470464.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10151878587159071882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5854771488655470464.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 : !((G((F("((i0.u2.p19==0)||(i0.u1.p16==1))"))U(X(X("((i8.i0.u26.p153==0)||(i3.u5.p24==1))"))))))
Formula 0 simplified : F(G!"((i0.u2.p19==0)||(i0.u1.p16==1))" R XX!"((i8.i0.u26.p153==0)||(i3.u5.p24==1))")
Reverse transition relation is NOT exact ! Due to transitions t2_t113, t13_t92, t14_t89, t15_t86, t26_t61, t1_t116, t110_t109_t166, t52_t53_t54_t136, t114_...777
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13266322444830999960
[2024-05-29 05:41:31] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13266322444830999960
Running compilation step : cd /tmp/ltsmin13266322444830999960;'/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 166 ms.
Running link step : cd /tmp/ltsmin13266322444830999960;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13266322444830999960;'/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)) U X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLCardinality-13 finished in 95371 ms.
[2024-05-29 05:41:46] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin57779997696232142
[2024-05-29 05:41:46] [INFO ] Applying decomposition
[2024-05-29 05:41:46] [INFO ] Computing symmetric may disable matrix : 175 transitions.
[2024-05-29 05:41:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:41:46] [INFO ] Computing symmetric may enable matrix : 175 transitions.
[2024-05-29 05:41:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:41:46] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:41:46] [INFO ] Computing Do-Not-Accords matrix : 175 transitions.
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/graph16509172155922515650.txt' '-o' '/tmp/graph16509172155922515650.bin' '-w' '/tmp/graph16509172155922515650.weights'
[2024-05-29 05:41:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:41:46] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin57779997696232142
Running compilation step : cd /tmp/ltsmin57779997696232142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16509172155922515650.bin' '-l' '-1' '-v' '-w' '/tmp/graph16509172155922515650.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:41:46] [INFO ] Decomposing Gal with order
[2024-05-29 05:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:41:46] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 05:41:46] [INFO ] Flatten gal took : 11 ms
[2024-05-29 05:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 05:41:46] [INFO ] Time to serialize gal into /tmp/LTLCardinality4532973864107203603.gal : 2 ms
[2024-05-29 05:41:46] [INFO ] Time to serialize properties into /tmp/LTLCardinality2282552812840410803.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/LTLCardinality4532973864107203603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2282552812840410803.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...276
Read 2 LTL properties
Checking formula 0 : !((X(G(((("((i4.i3.u27.p76==0)||(i3.i0.u13.p31==1))")U("((i1.i1.u24.p66==0)||(i6.i1.u40.p114==1))"))||(F("(i4.i1.u29.p79==1)")))||(("(...252
Formula 0 simplified : XF((!"((i4.i3.u27.p76==0)||(i3.i0.u13.p31==1))" R !"((i1.i1.u24.p66==0)||(i6.i1.u40.p114==1))") & G!"(i4.i1.u29.p79==1)" & (!"((i4.i...239
Compilation finished in 335 ms.
Running link step : cd /tmp/ltsmin57779997696232142;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin57779997696232142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t56, t59, t62, t84, t87, t90, t111, t114, t117, i0.i1.u6.t120, i1.i0.u10.t116, i1.i1.u23.t97,...1001
Computing Next relation with stutter on 7758 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.005: LTL layer: formula: X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.006: "X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.047: There are 182 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.047: State length is 191, there are 190 groups
pins2lts-mc-linux64( 0/ 8), 0.047: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.047: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.047: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.047: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.088: [Blue] ~120 levels ~960 states ~5896 transitions
pins2lts-mc-linux64( 0/ 8), 0.148: [Blue] ~240 levels ~1920 states ~11736 transitions
pins2lts-mc-linux64( 1/ 8), 0.199: [Blue] ~387 levels ~3840 states ~18600 transitions
pins2lts-mc-linux64( 0/ 8), 0.225: [Blue] ~417 levels ~7680 states ~28752 transitions
pins2lts-mc-linux64( 1/ 8), 0.312: [Blue] ~466 levels ~15360 states ~53296 transitions
pins2lts-mc-linux64( 1/ 8), 0.456: [Blue] ~466 levels ~30720 states ~108608 transitions
pins2lts-mc-linux64( 0/ 8), 0.699: [Blue] ~624 levels ~61440 states ~248720 transitions
pins2lts-mc-linux64( 0/ 8), 1.216: [Blue] ~810 levels ~122880 states ~473272 transitions
pins2lts-mc-linux64( 4/ 8), 2.047: [Blue] ~606 levels ~245760 states ~987768 transitions
pins2lts-mc-linux64( 4/ 8), 3.478: [Blue] ~606 levels ~491520 states ~2200688 transitions
pins2lts-mc-linux64( 4/ 8), 5.769: [Blue] ~606 levels ~983040 states ~4927048 transitions
pins2lts-mc-linux64( 7/ 8), 9.380: [Blue] ~494 levels ~1966080 states ~9498008 transitions
pins2lts-mc-linux64( 7/ 8), 16.318: [Blue] ~494 levels ~3932160 states ~20392200 transitions
pins2lts-mc-linux64( 7/ 8), 31.008: [Blue] ~494 levels ~7864320 states ~42608536 transitions
pins2lts-mc-linux64( 0/ 8), 62.129: [Blue] ~1764 levels ~15728640 states ~73165168 transitions
pins2lts-mc-linux64( 0/ 8), 122.848: [Blue] ~1764 levels ~31457280 states ~148090072 transitions
pins2lts-mc-linux64( 0/ 8), 244.502: [Blue] ~1764 levels ~62914560 states ~301609928 transitions
pins2lts-mc-linux64( 5/ 8), 511.818: [Blue] ~12108 levels ~125829120 states ~635186904 transitions
pins2lts-mc-linux64( 6/ 8), 621.278: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 621.326:
pins2lts-mc-linux64( 0/ 8), 621.327: Explored 135102086 states 916451795 transitions, fanout: 6.783
pins2lts-mc-linux64( 0/ 8), 621.327: Total exploration time 621.280 sec (621.200 sec minimum, 621.238 sec on average)
pins2lts-mc-linux64( 0/ 8), 621.327: States per second: 217458, Transitions per second: 1475103
pins2lts-mc-linux64( 0/ 8), 621.327:
pins2lts-mc-linux64( 0/ 8), 621.327: State space has 134217437 states, 10791399 are accepting
pins2lts-mc-linux64( 0/ 8), 621.327: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 621.327: blue states: 135102086 (100.66%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 621.327: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 621.327: all-red states: 45901289 (34.20%), bogus 133172 (0.10%)
pins2lts-mc-linux64( 0/ 8), 621.327:
pins2lts-mc-linux64( 0/ 8), 621.327: Total memory used for local state coloring: 0.4MB
pins2lts-mc-linux64( 0/ 8), 621.327:
pins2lts-mc-linux64( 0/ 8), 621.327: Queue width: 8B, total height: 24361, memory: 0.19MB
pins2lts-mc-linux64( 0/ 8), 621.327: Tree memory: 1115.1MB, 8.7 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 621.327: Tree fill ratio (roots/leafs): 99.0%/35.0%
pins2lts-mc-linux64( 0/ 8), 621.327: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 621.327: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 621.327: Est. total memory use: 1115.2MB (~1024.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin57779997696232142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin57779997696232142;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((((LTLAPp0==true) U (LTLAPp1==true))||<>((LTLAPp2==true))||((LTLAPp0==true)&&<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 06:03:59] [INFO ] Applying decomposition
[2024-05-29 06:03:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 06:03:59] [INFO ] Decomposing Gal with order
[2024-05-29 06:03:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:03:59] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 06:03:59] [INFO ] Flatten gal took : 10 ms
[2024-05-29 06:03:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 2 ms.
[2024-05-29 06:03:59] [INFO ] Time to serialize gal into /tmp/LTLCardinality1997760963621542909.gal : 3 ms
[2024-05-29 06:03:59] [INFO ] Time to serialize properties into /tmp/LTLCardinality7318473809666140480.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1997760963621542909.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality7318473809666140480.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...276
Read 2 LTL properties
Checking formula 0 : !((X(G(((("((i0.i1.i0.i0.u98.p76==0)||(i0.i0.i1.i0.i0.i0.i0.i1.u87.p31==1))")U("((i0.i0.i1.u24.p66==0)||(i0.i1.i0.i0.i0.u42.p114==1))"...333
Formula 0 simplified : XF((!"((i0.i1.i0.i0.u98.p76==0)||(i0.i0.i1.i0.i0.i0.i0.i1.u87.p31==1))" R !"((i0.i0.i1.u24.p66==0)||(i0.i1.i0.i0.i0.u42.p114==1))") ...320
Detected timeout of ITS tools.
[2024-05-29 06:26:16] [INFO ] Flatten gal took : 139 ms
[2024-05-29 06:26:16] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-29 06:26:17] [INFO ] Transformed 190 places.
[2024-05-29 06:26:17] [INFO ] Transformed 175 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 06:26:17] [INFO ] Time to serialize gal into /tmp/LTLCardinality5769896983230044413.gal : 7 ms
[2024-05-29 06:26:17] [INFO ] Time to serialize properties into /tmp/LTLCardinality2220222367272153575.ltl : 12 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/LTLCardinality5769896983230044413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality2220222367272153575.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(((("((p76==0)||(p31==1))")U("((p66==0)||(p114==1))"))||(F("(p79==1)")))||(("((p76==0)||(p31==1))")&&(F(G("((p173==0)||(p3==1))"...163
Formula 0 simplified : XF((!"((p76==0)||(p31==1))" R !"((p66==0)||(p114==1))") & G!"(p79==1)" & (!"((p76==0)||(p31==1))" | GF!"((p173==0)||(p3==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 4442320 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16145116 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldPPPs-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 ShieldPPPs-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-171683788900247"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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