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-171683788400048.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldIIPs-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788400048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.4K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 11 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 82K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716931522278

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-005B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 21:25:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 21:25:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:25:24] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-28 21:25:24] [INFO ] Transformed 303 places.
[2024-05-28 21:25:24] [INFO ] Transformed 298 transitions.
[2024-05-28 21:25:24] [INFO ] Found NUPN structural information;
[2024-05-28 21:25:24] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldIIPs-PT-005B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 298/298 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 279 transition count 274
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 279 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 278 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 278 transition count 273
Applied a total of 50 rules in 58 ms. Remains 278 /303 variables (removed 25) and now considering 273/298 (removed 25) transitions.
// Phase 1: matrix 273 rows 278 cols
[2024-05-28 21:25:24] [INFO ] Computed 46 invariants in 17 ms
[2024-05-28 21:25:25] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-28 21:25:25] [INFO ] Invariant cache hit.
[2024-05-28 21:25:25] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
[2024-05-28 21:25:25] [INFO ] Invariant cache hit.
[2024-05-28 21:25:25] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/303 places, 273/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 870 ms. Remains : 278/303 places, 273/298 transitions.
Support contains 50 out of 278 places after structural reductions.
[2024-05-28 21:25:25] [INFO ] Flatten gal took : 48 ms
[2024-05-28 21:25:25] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:25:26] [INFO ] Input system was already deterministic with 273 transitions.
Support contains 49 out of 278 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 32) seen :28
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2024-05-28 21:25:26] [INFO ] Invariant cache hit.
[2024-05-28 21:25:26] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-28 21:25:26] [INFO ] [Nat]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 21:25:26] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2024-05-28 21:25:27] [INFO ] Deduced a trap composed of 30 places in 170 ms of which 4 ms to minimize.
[2024-05-28 21:25:27] [INFO ] Deduced a trap composed of 15 places in 192 ms of which 1 ms to minimize.
[2024-05-28 21:25:27] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2024-05-28 21:25:27] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-05-28 21:25:27] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2024-05-28 21:25:27] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-05-28 21:25:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 865 ms
[2024-05-28 21:25:27] [INFO ] After 965ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-28 21:25:27] [INFO ] After 1058ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 273/273 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 278 transition count 247
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 252 transition count 247
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 252 transition count 222
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 227 transition count 222
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 217 transition count 212
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 217 transition count 212
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 122 place count 217 transition count 208
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 213 transition count 208
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 300 place count 128 transition count 123
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 2 with 33 rules applied. Total rules applied 333 place count 128 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 334 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 335 place count 126 transition count 122
Applied a total of 335 rules in 68 ms. Remains 126 /278 variables (removed 152) and now considering 122/273 (removed 151) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 126/278 places, 122/273 transitions.
Finished random walk after 242 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=121 )
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||X((p1&&G(p0)))) U p2) U p3))'
Support contains 8 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 267 transition count 262
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 267 transition count 262
Applied a total of 22 rules in 8 ms. Remains 267 /278 variables (removed 11) and now considering 262/273 (removed 11) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 21:25:28] [INFO ] Computed 46 invariants in 6 ms
[2024-05-28 21:25:28] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-28 21:25:28] [INFO ] Invariant cache hit.
[2024-05-28 21:25:28] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-28 21:25:28] [INFO ] Invariant cache hit.
[2024-05-28 21:25:28] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/278 places, 262/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 267/278 places, 262/273 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 317 ms :[(NOT p3), (OR (NOT p1) (NOT p0)), (NOT p2), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p3:(OR (EQ s121 1) (AND (EQ s28 1) (EQ s36 1) (EQ s58 1))), p2:(OR (EQ s261 1) (AND (EQ s28 1) (EQ s36 1) (EQ s58 1))), p0:(AND (EQ s83 1) (EQ s101 1) (EQ...], 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-00 finished in 892 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 252 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 298 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 125 transition count 121
Applied a total of 301 rules in 38 ms. Remains 125 /278 variables (removed 153) and now considering 121/273 (removed 152) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 21:25:29] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:25:29] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-28 21:25:29] [INFO ] Invariant cache hit.
[2024-05-28 21:25:29] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-28 21:25:29] [INFO ] Redundant transitions in 26 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 21:25:29] [INFO ] Computed 45 invariants in 4 ms
[2024-05-28 21:25:29] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/278 places, 120/273 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 391 ms. Remains : 125/278 places, 120/273 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s55 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1217 reset in 372 ms.
Product exploration explored 100000 steps with 1198 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0)]
[2024-05-28 21:25:30] [INFO ] Invariant cache hit.
[2024-05-28 21:25:30] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:25:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:25:30] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-28 21:25:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:25:30] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:25:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:25:30] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-05-28 21:25:30] [INFO ] Computed and/alt/rep : 119/288/119 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 21:25:31] [INFO ] Added : 111 causal constraints over 24 iterations in 389 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 21:25:31] [INFO ] Invariant cache hit.
[2024-05-28 21:25:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 21:25:31] [INFO ] Invariant cache hit.
[2024-05-28 21:25:31] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-28 21:25:31] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-28 21:25:31] [INFO ] Invariant cache hit.
[2024-05-28 21:25:31] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 125/125 places, 120/120 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Finished random walk after 102 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-28 21:25:32] [INFO ] Invariant cache hit.
[2024-05-28 21:25:32] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:25:32] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-28 21:25:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:25:32] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:25:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:25:32] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-05-28 21:25:32] [INFO ] Computed and/alt/rep : 119/288/119 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 21:25:32] [INFO ] Added : 111 causal constraints over 24 iterations in 322 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1236 reset in 235 ms.
Product exploration explored 100000 steps with 1236 reset in 260 ms.
Built C files in :
/tmp/ltsmin9095727963623927711
[2024-05-28 21:25:33] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 21:25:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:33] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 21:25:33] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:33] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 21:25:33] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:33] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9095727963623927711
Running compilation step : cd /tmp/ltsmin9095727963623927711;'/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 362 ms.
Running link step : cd /tmp/ltsmin9095727963623927711;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9095727963623927711;'/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/stateBased14958620871873792459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 120/120 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
[2024-05-28 21:25:48] [INFO ] Invariant cache hit.
[2024-05-28 21:25:48] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 21:25:48] [INFO ] Invariant cache hit.
[2024-05-28 21:25:48] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-28 21:25:48] [INFO ] Redundant transitions in 21 ms returned []
[2024-05-28 21:25:48] [INFO ] Invariant cache hit.
[2024-05-28 21:25:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 125/125 places, 120/120 transitions.
Built C files in :
/tmp/ltsmin8895359529569804428
[2024-05-28 21:25:48] [INFO ] Computing symmetric may disable matrix : 120 transitions.
[2024-05-28 21:25:48] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:48] [INFO ] Computing symmetric may enable matrix : 120 transitions.
[2024-05-28 21:25:48] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:48] [INFO ] Computing Do-Not-Accords matrix : 120 transitions.
[2024-05-28 21:25:48] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:25:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8895359529569804428
Running compilation step : cd /tmp/ltsmin8895359529569804428;'/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 238 ms.
Running link step : cd /tmp/ltsmin8895359529569804428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8895359529569804428;'/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/stateBased10914282794888902012.hoa' '--buchi-type=spotba'
LTSmin run took 469 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLFireability-01 finished in 20385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||G(p2)))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 50 place count 252 transition count 223
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 98 place count 228 transition count 223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 107 place count 219 transition count 214
Iterating global reduction 2 with 9 rules applied. Total rules applied 116 place count 219 transition count 214
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 116 place count 219 transition count 211
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 122 place count 216 transition count 211
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 290 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 130 transition count 125
Applied a total of 292 rules in 30 ms. Remains 130 /278 variables (removed 148) and now considering 125/273 (removed 148) transitions.
// Phase 1: matrix 125 rows 130 cols
[2024-05-28 21:25:49] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 21:25:49] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 21:25:49] [INFO ] Invariant cache hit.
[2024-05-28 21:25:49] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-28 21:25:49] [INFO ] Redundant transitions in 35 ms returned []
[2024-05-28 21:25:49] [INFO ] Invariant cache hit.
[2024-05-28 21:25:49] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/278 places, 125/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 130/278 places, 125/273 transitions.
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s45 1), p2:(OR (EQ s116 0) (EQ s124 0) (EQ s128 0)), p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 16886 reset in 256 ms.
Product exploration explored 100000 steps with 16673 reset in 245 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 1800 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Finished random walk after 1362 steps, including 4 resets, run visited all 9 properties in 41 ms. (steps per millisecond=33 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F p0), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 2287 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-28 21:25:55] [INFO ] Invariant cache hit.
[2024-05-28 21:25:55] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 21:25:55] [INFO ] Invariant cache hit.
[2024-05-28 21:25:55] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-28 21:25:55] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-28 21:25:55] [INFO ] Invariant cache hit.
[2024-05-28 21:25:55] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 130/130 places, 125/125 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/130 stabilizing places and 4/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 1627 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Finished random walk after 338 steps, including 1 resets, run visited all 9 properties in 18 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X p1), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) p2 (NOT p1)))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND (NOT p0) p2))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 11 factoid took 2260 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 16885 reset in 219 ms.
Product exploration explored 100000 steps with 16713 reset in 239 ms.
Built C files in :
/tmp/ltsmin3506316629836056743
[2024-05-28 21:26:00] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-28 21:26:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:26:00] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-28 21:26:00] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:26:00] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-28 21:26:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:26:00] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3506316629836056743
Running compilation step : cd /tmp/ltsmin3506316629836056743;'/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 253 ms.
Running link step : cd /tmp/ltsmin3506316629836056743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3506316629836056743;'/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/stateBased4653932826400361278.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-28 21:26:15] [INFO ] Invariant cache hit.
[2024-05-28 21:26:15] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 21:26:15] [INFO ] Invariant cache hit.
[2024-05-28 21:26:15] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-28 21:26:15] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-28 21:26:15] [INFO ] Invariant cache hit.
[2024-05-28 21:26:15] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 130/130 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin9615477867656773357
[2024-05-28 21:26:15] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-28 21:26:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:26:15] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-28 21:26:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:26:15] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-28 21:26:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:26:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9615477867656773357
Running compilation step : cd /tmp/ltsmin9615477867656773357;'/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/ltsmin9615477867656773357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin9615477867656773357;'/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/stateBased9028731626622380166.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:26:30] [INFO ] Flatten gal took : 11 ms
[2024-05-28 21:26:31] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:26:31] [INFO ] Time to serialize gal into /tmp/LTL2763959796563513801.gal : 3 ms
[2024-05-28 21:26:31] [INFO ] Time to serialize properties into /tmp/LTL6250201039119595667.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/LTL2763959796563513801.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13964491932070284864.hoa' '-atoms' '/tmp/LTL6250201039119595667.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/LTL6250201039119595667.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13964491932070284864.hoa
Detected timeout of ITS tools.
[2024-05-28 21:26:46] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:26:46] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:26:46] [INFO ] Time to serialize gal into /tmp/LTL12468953785354249377.gal : 2 ms
[2024-05-28 21:26:46] [INFO ] Time to serialize properties into /tmp/LTL11208392430642478196.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/LTL12468953785354249377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11208392430642478196.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("(p100==1)"))U("(p101==1)"))||(G("(((p267==0)||(p286==0))||(p297==0))"))))
Formula 0 simplified : (G!"(p100==1)" R !"(p101==1)") & F!"(((p267==0)||(p286==0))||(p297==0))"
Detected timeout of ITS tools.
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:27:01] [INFO ] Applying decomposition
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 13 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/graph5319192466881583081.txt' '-o' '/tmp/graph5319192466881583081.bin' '-w' '/tmp/graph5319192466881583081.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5319192466881583081.bin' '-l' '-1' '-v' '-w' '/tmp/graph5319192466881583081.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:27:01] [INFO ] Decomposing Gal with order
[2024-05-28 21:27:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:27:01] [INFO ] Removed a total of 82 redundant transitions.
[2024-05-28 21:27:01] [INFO ] Flatten gal took : 80 ms
[2024-05-28 21:27:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 17 ms.
[2024-05-28 21:27:01] [INFO ] Time to serialize gal into /tmp/LTL7539601955207213839.gal : 11 ms
[2024-05-28 21:27:01] [INFO ] Time to serialize properties into /tmp/LTL18393740629842633238.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/LTL7539601955207213839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18393740629842633238.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((((F("(i1.i2.u15.p100==1)"))U("(i1.i0.u17.p101==1)"))||(G("(((i4.i2.u42.p267==0)||(i4.i2.u45.p286==0))||(i4.i0.u46.p297==0))"))))
Formula 0 simplified : (G!"(i1.i2.u15.p100==1)" R !"(i1.i0.u17.p101==1)") & F!"(((i4.i2.u42.p267==0)||(i4.i2.u45.p286==0))||(i4.i0.u46.p297==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12704547912628243330
[2024-05-28 21:27:16] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12704547912628243330
Running compilation step : cd /tmp/ltsmin12704547912628243330;'/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 221 ms.
Running link step : cd /tmp/ltsmin12704547912628243330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12704547912628243330;'/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 (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-02 finished in 102102 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(p0))||G((F(p1)||(!p2 U (p3||G(!p2)))))))'
Support contains 9 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 9 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 21:27:31] [INFO ] Computed 46 invariants in 4 ms
[2024-05-28 21:27:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 21:27:31] [INFO ] Invariant cache hit.
[2024-05-28 21:27:31] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2024-05-28 21:27:31] [INFO ] Invariant cache hit.
[2024-05-28 21:27:32] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p1) (NOT p3) p2 (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3) p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s109 1), p3:(AND (NOT (AND (EQ s185 1) (EQ s195 1) (EQ s215 1))) (NOT (AND (EQ s18 1) (EQ s42 1)))), p2:(AND (EQ s18 1) (EQ s42 1)), p0:(AND (EQ s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 32810 steps with 100 reset in 79 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-03 finished in 692 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((p0&&(p1||F(p2))))))'
Support contains 6 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 10 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 21:27:32] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 21:27:32] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 21:27:32] [INFO ] Invariant cache hit.
[2024-05-28 21:27:32] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2024-05-28 21:27:32] [INFO ] Invariant cache hit.
[2024-05-28 21:27:32] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s258 1) (AND (EQ s132 1) (EQ s142 1) (EQ s161 1))), p1:(AND (EQ s190 1) (EQ s234 1)), p2:(EQ s258 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 3874 reset in 189 ms.
Product exploration explored 100000 steps with 3834 reset in 201 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 14 resets, run finished after 231 ms. (steps per millisecond=43 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-28 21:27:34] [INFO ] Invariant cache hit.
[2024-05-28 21:27:34] [INFO ] [Real]Absence check using 46 positive place invariants in 10 ms returned sat
[2024-05-28 21:27:34] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:34] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2024-05-28 21:27:34] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 21:27:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 390 ms
[2024-05-28 21:27:34] [INFO ] After 490ms 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-28 21:27:34] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 263/263 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 268 transition count 238
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 243 transition count 238
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 243 transition count 212
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 217 transition count 212
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 274 place count 131 transition count 126
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 2 with 31 rules applied. Total rules applied 305 place count 131 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 306 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 307 place count 129 transition count 125
Applied a total of 307 rules in 19 ms. Remains 129 /268 variables (removed 139) and now considering 125/263 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 129/268 places, 125/263 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1460397 steps, run timeout after 3001 ms. (steps per millisecond=486 ) properties seen :{}
Probabilistic random walk after 1460397 steps, saw 282385 distinct states, run finished after 3002 ms. (steps per millisecond=486 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 129 cols
[2024-05-28 21:27:37] [INFO ] Computed 45 invariants in 6 ms
[2024-05-28 21:27:37] [INFO ] [Real]Absence check using 44 positive place invariants in 9 ms returned sat
[2024-05-28 21:27:37] [INFO ] [Real]Absence check using 44 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:27:37] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-28 21:27:37] [INFO ] [Nat]Absence check using 44 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 21:27:38] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:27:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-28 21:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-28 21:27:38] [INFO ] After 99ms 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-28 21:27:38] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 129/129 places, 125/125 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2024-05-28 21:27:38] [INFO ] Invariant cache hit.
[2024-05-28 21:27:38] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 21:27:38] [INFO ] Invariant cache hit.
[2024-05-28 21:27:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-28 21:27:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 21:27:38] [INFO ] Invariant cache hit.
[2024-05-28 21:27:38] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 129/129 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 129 /129 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-28 21:27:38] [INFO ] Invariant cache hit.
[2024-05-28 21:27:38] [INFO ] [Real]Absence check using 44 positive place invariants in 6 ms returned sat
[2024-05-28 21:27:38] [INFO ] [Real]Absence check using 44 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 21:27:38] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:38] [INFO ] [Nat]Absence check using 44 positive place invariants in 5 ms returned sat
[2024-05-28 21:27:38] [INFO ] [Nat]Absence check using 44 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-28 21:27:38] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:27:38] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-28 21:27:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-28 21:27:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2024-05-28 21:27:38] [INFO ] After 128ms 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-28 21:27:38] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p2) p0 (NOT p1))), (F p0), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 7 factoid took 289 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 319 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 282 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 21:27:39] [INFO ] Computed 46 invariants in 4 ms
[2024-05-28 21:27:39] [INFO ] [Real]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 21:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:39] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-28 21:27:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:27:40] [INFO ] [Nat]Absence check using 46 positive place invariants in 14 ms returned sat
[2024-05-28 21:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:40] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2024-05-28 21:27:40] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 21:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-28 21:27:40] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-28 21:27:42] [INFO ] Added : 235 causal constraints over 47 iterations in 1691 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-28 21:27:42] [INFO ] Invariant cache hit.
[2024-05-28 21:27:42] [INFO ] [Real]Absence check using 46 positive place invariants in 13 ms returned sat
[2024-05-28 21:27:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:42] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2024-05-28 21:27:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:27:42] [INFO ] [Nat]Absence check using 46 positive place invariants in 13 ms returned sat
[2024-05-28 21:27:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:42] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-28 21:27:42] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 21:27:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-28 21:27:42] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 17 ms.
[2024-05-28 21:27:44] [INFO ] Added : 262 causal constraints over 54 iterations in 1883 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 268 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 238
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 243 transition count 238
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 48 place count 243 transition count 212
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 100 place count 217 transition count 212
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 268 place count 133 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 270 place count 131 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 271 place count 130 transition count 126
Applied a total of 271 rules in 25 ms. Remains 130 /268 variables (removed 138) and now considering 126/263 (removed 137) transitions.
// Phase 1: matrix 126 rows 130 cols
[2024-05-28 21:27:44] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:27:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 21:27:44] [INFO ] Invariant cache hit.
[2024-05-28 21:27:44] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-28 21:27:44] [INFO ] Redundant transitions in 19 ms returned [125]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 125 rows 130 cols
[2024-05-28 21:27:44] [INFO ] Computed 45 invariants in 4 ms
[2024-05-28 21:27:44] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/268 places, 125/263 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 130/268 places, 125/263 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Detected a total of 3/130 stabilizing places and 3/125 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1)))))]
Knowledge based reduction with 8 factoid took 422 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 34 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 21:27:45] [INFO ] Invariant cache hit.
[2024-05-28 21:27:45] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 21:27:45] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:45] [INFO ] [Nat]Absence check using 45 positive place invariants in 5 ms returned sat
[2024-05-28 21:27:45] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:27:45] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-28 21:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-28 21:27:45] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-28 21:27:45] [INFO ] After 126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 130/130 places, 125/125 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 130 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 129 transition count 124
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 0 with 27 rules applied. Total rules applied 29 place count 129 transition count 124
Applied a total of 29 rules in 8 ms. Remains 129 /130 variables (removed 1) and now considering 124/125 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 129/130 places, 124/125 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1398956 steps, run timeout after 3001 ms. (steps per millisecond=466 ) properties seen :{}
Probabilistic random walk after 1398956 steps, saw 292059 distinct states, run finished after 3004 ms. (steps per millisecond=465 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 124 rows 129 cols
[2024-05-28 21:27:49] [INFO ] Computed 45 invariants in 4 ms
[2024-05-28 21:27:49] [INFO ] [Real]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 21:27:49] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 21:27:49] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:27:49] [INFO ] After 47ms 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-28 21:27:49] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 7 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 129/129 places, 124/124 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 21:27:49] [INFO ] Invariant cache hit.
[2024-05-28 21:27:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 21:27:49] [INFO ] Invariant cache hit.
[2024-05-28 21:27:49] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-28 21:27:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-28 21:27:49] [INFO ] Invariant cache hit.
[2024-05-28 21:27:49] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 321 ms. Remains : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-28 21:27:49] [INFO ] Invariant cache hit.
[2024-05-28 21:27:49] [INFO ] [Real]Absence check using 45 positive place invariants in 5 ms returned sat
[2024-05-28 21:27:49] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 21:27:49] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2024-05-28 21:27:49] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 21:27:49] [INFO ] After 64ms 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-28 21:27:49] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p2 p0 (NOT p1))), (X (NOT (AND p2 p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1)))))), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (AND (NOT p2) p0 (NOT p1))), (F p0), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), (F (AND p2 p0 (NOT p1))), (F (AND (NOT p2) p0 p1))]
Knowledge based reduction with 8 factoid took 576 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter insensitive) to 7 states, 19 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 276 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
// Phase 1: matrix 125 rows 130 cols
[2024-05-28 21:27:50] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:27:50] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:51] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-28 21:27:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:27:51] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:51] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-28 21:27:51] [INFO ] Computed and/alt/rep : 122/308/122 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-28 21:27:51] [INFO ] Added : 100 causal constraints over 20 iterations in 290 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-28 21:27:51] [INFO ] Invariant cache hit.
[2024-05-28 21:27:51] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:27:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:51] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-28 21:27:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:27:51] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:27:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:51] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-28 21:27:51] [INFO ] Computed and/alt/rep : 122/308/122 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-28 21:27:52] [INFO ] Added : 105 causal constraints over 22 iterations in 299 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33370 reset in 239 ms.
Product exploration explored 100000 steps with 33333 reset in 255 ms.
Built C files in :
/tmp/ltsmin7330620861553331057
[2024-05-28 21:27:52] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2024-05-28 21:27:52] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:27:52] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2024-05-28 21:27:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:27:52] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2024-05-28 21:27:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:27:52] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7330620861553331057
Running compilation step : cd /tmp/ltsmin7330620861553331057;'/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 263 ms.
Running link step : cd /tmp/ltsmin7330620861553331057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7330620861553331057;'/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/stateBased11741419237658400992.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldIIPs-PT-005B-LTLFireability-04 finished in 21056 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(p0))||G(p1)||F(p2)))'
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 8 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 21:27:53] [INFO ] Computed 46 invariants in 2 ms
[2024-05-28 21:27:53] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-28 21:27:53] [INFO ] Invariant cache hit.
[2024-05-28 21:27:53] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2024-05-28 21:27:53] [INFO ] Invariant cache hit.
[2024-05-28 21:27:53] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s228 1) (EQ s249 1)), p0:(EQ s224 1), p1:(EQ s144 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 1793 reset in 193 ms.
Product exploration explored 100000 steps with 1818 reset in 196 ms.
Computed a total of 60 stabilizing places and 60 stable transitions
Computed a total of 60 stabilizing places and 60 stable transitions
Detected a total of 60/268 stabilizing places and 60/263 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 217 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 269 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-28 21:27:54] [INFO ] Invariant cache hit.
[2024-05-28 21:27:55] [INFO ] [Real]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 21:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:55] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-28 21:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:27:55] [INFO ] [Nat]Absence check using 46 positive place invariants in 13 ms returned sat
[2024-05-28 21:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:55] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2024-05-28 21:27:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2024-05-28 21:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-28 21:27:55] [INFO ] Computed and/alt/rep : 262/588/262 causal constraints (skipped 0 transitions) in 16 ms.
[2024-05-28 21:27:57] [INFO ] Added : 262 causal constraints over 55 iterations in 2113 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 268 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 268/268 places, 263/263 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 238
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 243 transition count 238
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 243 transition count 211
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 216 transition count 211
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 272 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 274 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 275 place count 128 transition count 124
Applied a total of 275 rules in 24 ms. Remains 128 /268 variables (removed 140) and now considering 124/263 (removed 139) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 21:27:57] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:27:57] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 21:27:57] [INFO ] Invariant cache hit.
[2024-05-28 21:27:57] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 21:27:57] [INFO ] Redundant transitions in 22 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 21:27:57] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 21:27:57] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/268 places, 123/263 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 322 ms. Remains : 128/268 places, 123/263 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-28 21:27:58] [INFO ] Invariant cache hit.
[2024-05-28 21:27:58] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 21:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:58] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-28 21:27:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:27:58] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:27:58] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-28 21:27:58] [INFO ] Computed and/alt/rep : 119/294/119 causal constraints (skipped 1 transitions) in 9 ms.
[2024-05-28 21:27:59] [INFO ] Added : 100 causal constraints over 24 iterations in 395 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24556 reset in 212 ms.
Product exploration explored 100000 steps with 24648 reset in 218 ms.
Built C files in :
/tmp/ltsmin78135744071104771
[2024-05-28 21:27:59] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 21:27:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:27:59] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 21:27:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:27:59] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 21:27:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:27:59] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin78135744071104771
Running compilation step : cd /tmp/ltsmin78135744071104771;'/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 248 ms.
Running link step : cd /tmp/ltsmin78135744071104771;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin78135744071104771;'/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/stateBased2361014749507780588.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 121
Applied a total of 1 rules in 20 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 21:28:14] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:28:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-28 21:28:14] [INFO ] Invariant cache hit.
[2024-05-28 21:28:15] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-28 21:28:15] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-28 21:28:15] [INFO ] Invariant cache hit.
[2024-05-28 21:28:15] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 121/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 126/128 places, 121/123 transitions.
Built C files in :
/tmp/ltsmin7502898887636892407
[2024-05-28 21:28:15] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 21:28:15] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:28:15] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 21:28:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:28:15] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 21:28:15] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:28:15] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7502898887636892407
Running compilation step : cd /tmp/ltsmin7502898887636892407;'/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 242 ms.
Running link step : cd /tmp/ltsmin7502898887636892407;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7502898887636892407;'/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/stateBased4644915929375995746.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:28:30] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:28:30] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:28:30] [INFO ] Time to serialize gal into /tmp/LTL13016790273655642342.gal : 1 ms
[2024-05-28 21:28:30] [INFO ] Time to serialize properties into /tmp/LTL738461856129964063.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/LTL13016790273655642342.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15987098692435639691.hoa' '-atoms' '/tmp/LTL738461856129964063.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/LTL738461856129964063.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15987098692435639691.hoa
Detected timeout of ITS tools.
[2024-05-28 21:28:45] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:28:45] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:28:45] [INFO ] Time to serialize gal into /tmp/LTL18266973908360335705.gal : 1 ms
[2024-05-28 21:28:45] [INFO ] Time to serialize properties into /tmp/LTL8552843460118560556.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/LTL18266973908360335705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8552843460118560556.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(F("(p251==1)")))||(G("(p159==1)")))||(F("((p255==1)&&(p280==1))"))))
Formula 0 simplified : XG!"(p251==1)" & F!"(p159==1)" & G!"((p255==1)&&(p280==1))"
Detected timeout of ITS tools.
[2024-05-28 21:29:00] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:29:00] [INFO ] Applying decomposition
[2024-05-28 21:29:00] [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/graph6086044468723130641.txt' '-o' '/tmp/graph6086044468723130641.bin' '-w' '/tmp/graph6086044468723130641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6086044468723130641.bin' '-l' '-1' '-v' '-w' '/tmp/graph6086044468723130641.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:29:00] [INFO ] Decomposing Gal with order
[2024-05-28 21:29:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:29:00] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 21:29:00] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:29:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 3 ms.
[2024-05-28 21:29:00] [INFO ] Time to serialize gal into /tmp/LTL10614965329512952280.gal : 6 ms
[2024-05-28 21:29:00] [INFO ] Time to serialize properties into /tmp/LTL10435110516673408685.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/LTL10614965329512952280.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10435110516673408685.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((X(F("(i4.i0.u38.p251==1)")))||(G("(i2.i0.u24.p159==1)")))||(F("((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"))))
Formula 0 simplified : XG!"(i4.i0.u38.p251==1)" & F!"(i2.i0.u24.p159==1)" & G!"((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16044814619941029254
[2024-05-28 21:29:15] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16044814619941029254
Running compilation step : cd /tmp/ltsmin16044814619941029254;'/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 214 ms.
Running link step : cd /tmp/ltsmin16044814619941029254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin16044814619941029254;'/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)))||[]((LTLAPp1==true))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 97420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 298 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 125 transition count 121
Applied a total of 301 rules in 22 ms. Remains 125 /278 variables (removed 153) and now considering 121/273 (removed 152) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 21:29:30] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:29:30] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 21:29:30] [INFO ] Invariant cache hit.
[2024-05-28 21:29:30] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-28 21:29:30] [INFO ] Redundant transitions in 22 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 21:29:30] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:29:31] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/278 places, 120/273 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 309 ms. Remains : 125/278 places, 120/273 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 262 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-06 finished in 363 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((G(p1)||p0)))'
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 52 place count 251 transition count 221
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 216 transition count 211
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 122 place count 216 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 212 transition count 207
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 292 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 128 transition count 124
Applied a total of 295 rules in 25 ms. Remains 128 /278 variables (removed 150) and now considering 124/273 (removed 149) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 21:29:31] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:29:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-28 21:29:31] [INFO ] Invariant cache hit.
[2024-05-28 21:29:31] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-28 21:29:31] [INFO ] Redundant transitions in 20 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 21:29:31] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 21:29:31] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/278 places, 123/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 128/278 places, 123/273 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (EQ s1 0) (EQ s10 0)), p0:(OR (EQ s44 0) (EQ s4 0) (EQ s21 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 272 steps with 0 reset in 3 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-07 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 211 transition count 206
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 294 place count 130 transition count 125
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 128 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 297 place count 127 transition count 123
Applied a total of 297 rules in 21 ms. Remains 127 /278 variables (removed 151) and now considering 123/273 (removed 150) transitions.
// Phase 1: matrix 123 rows 127 cols
[2024-05-28 21:29:31] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 21:29:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 21:29:31] [INFO ] Invariant cache hit.
[2024-05-28 21:29:31] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 21:29:31] [INFO ] Redundant transitions in 19 ms returned [122]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 122 rows 127 cols
[2024-05-28 21:29:31] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 21:29:31] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/278 places, 122/273 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 338 ms. Remains : 127/278 places, 122/273 transitions.
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-08 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}]], initial=1, aps=[p0:(OR (EQ s53 0) (EQ s114 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 354 reset in 300 ms.
Product exploration explored 100000 steps with 352 reset in 311 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 35 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished Best-First random walk after 177 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=177 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldIIPs-PT-005B-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldIIPs-PT-005B-LTLFireability-08 finished in 1258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 51 place count 252 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 124 place count 215 transition count 207
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 130 place count 212 transition count 207
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 292 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 295 place count 128 transition count 124
Applied a total of 295 rules in 25 ms. Remains 128 /278 variables (removed 150) and now considering 124/273 (removed 149) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 21:29:32] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 21:29:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-28 21:29:32] [INFO ] Invariant cache hit.
[2024-05-28 21:29:33] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-28 21:29:33] [INFO ] Redundant transitions in 19 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 21:29:33] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:29:33] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/278 places, 123/273 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 128/278 places, 123/273 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s64 1), p0:(NEQ s91 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 499 reset in 247 ms.
Product exploration explored 100000 steps with 507 reset in 283 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 4 factoid took 444 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p0)]
Finished random walk after 570 steps, including 2 resets, run visited all 3 properties in 4 ms. (steps per millisecond=142 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 569 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 21:29:35] [INFO ] Invariant cache hit.
[2024-05-28 21:29:35] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 21:29:35] [INFO ] Invariant cache hit.
[2024-05-28 21:29:35] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-28 21:29:35] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-28 21:29:35] [INFO ] Invariant cache hit.
[2024-05-28 21:29:35] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 128/128 places, 123/123 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 425 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 515 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 520 reset in 257 ms.
Product exploration explored 100000 steps with 509 reset in 283 ms.
Built C files in :
/tmp/ltsmin14469676016091395150
[2024-05-28 21:29:37] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 21:29:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:29:37] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 21:29:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:29:37] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 21:29:37] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:29:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14469676016091395150
Running compilation step : cd /tmp/ltsmin14469676016091395150;'/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/ltsmin14469676016091395150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14469676016091395150;'/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/stateBased1782967899258451832.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Applied a total of 0 rules in 6 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
[2024-05-28 21:29:52] [INFO ] Invariant cache hit.
[2024-05-28 21:29:52] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 21:29:52] [INFO ] Invariant cache hit.
[2024-05-28 21:29:52] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-28 21:29:52] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-28 21:29:52] [INFO ] Invariant cache hit.
[2024-05-28 21:29:52] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 128/128 places, 123/123 transitions.
Built C files in :
/tmp/ltsmin9439149621958117979
[2024-05-28 21:29:52] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 21:29:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:29:52] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 21:29:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:29:52] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 21:29:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:29:52] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9439149621958117979
Running compilation step : cd /tmp/ltsmin9439149621958117979;'/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 247 ms.
Running link step : cd /tmp/ltsmin9439149621958117979;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9439149621958117979;'/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/stateBased1507585290405133690.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:30:07] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:30:07] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:30:07] [INFO ] Time to serialize gal into /tmp/LTL4538420838739487522.gal : 2 ms
[2024-05-28 21:30:07] [INFO ] Time to serialize properties into /tmp/LTL15075892368803217963.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/LTL4538420838739487522.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8470108426130251786.hoa' '-atoms' '/tmp/LTL15075892368803217963.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/LTL15075892368803217963.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8470108426130251786.hoa
Detected timeout of ITS tools.
[2024-05-28 21:30:22] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:30:22] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:30:22] [INFO ] Time to serialize gal into /tmp/LTL10173812951395992214.gal : 1 ms
[2024-05-28 21:30:22] [INFO ] Time to serialize properties into /tmp/LTL17503556598486416849.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/LTL10173812951395992214.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17503556598486416849.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("(p209!=1)"))U(G("(p150!=1)"))))
Formula 0 simplified : G!"(p209!=1)" R F!"(p150!=1)"
Detected timeout of ITS tools.
[2024-05-28 21:30:37] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:30:37] [INFO ] Applying decomposition
[2024-05-28 21:30:37] [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/graph929609458516053899.txt' '-o' '/tmp/graph929609458516053899.bin' '-w' '/tmp/graph929609458516053899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph929609458516053899.bin' '-l' '-1' '-v' '-w' '/tmp/graph929609458516053899.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:30:37] [INFO ] Decomposing Gal with order
[2024-05-28 21:30:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:30:37] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 21:30:37] [INFO ] Flatten gal took : 16 ms
[2024-05-28 21:30:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 6 ms.
[2024-05-28 21:30:37] [INFO ] Time to serialize gal into /tmp/LTL13152045401195295599.gal : 5 ms
[2024-05-28 21:30:37] [INFO ] Time to serialize properties into /tmp/LTL8211227828061519367.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/LTL13152045401195295599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8211227828061519367.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("(i3.i1.u34.p209!=1)"))U(G("(i2.i0.u24.p150!=1)"))))
Formula 0 simplified : G!"(i3.i1.u34.p209!=1)" R F!"(i2.i0.u24.p150!=1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13554594145396326368
[2024-05-28 21:30:53] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13554594145396326368
Running compilation step : cd /tmp/ltsmin13554594145396326368;'/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 224 ms.
Running link step : cd /tmp/ltsmin13554594145396326368;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13554594145396326368;'/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 []((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-09 finished in 95301 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(X(F(p0)))))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 267 transition count 262
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 267 transition count 262
Applied a total of 22 rules in 9 ms. Remains 267 /278 variables (removed 11) and now considering 262/273 (removed 11) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 21:31:08] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 21:31:08] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-28 21:31:08] [INFO ] Invariant cache hit.
[2024-05-28 21:31:08] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-28 21:31:08] [INFO ] Invariant cache hit.
[2024-05-28 21:31:08] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 267/278 places, 262/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 267/278 places, 262/273 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s91 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 1162 reset in 194 ms.
Product exploration explored 100000 steps with 1158 reset in 209 ms.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=47 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 21:31:09] [INFO ] Invariant cache hit.
[2024-05-28 21:31:09] [INFO ] [Real]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 21:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:31:10] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-28 21:31:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:31:10] [INFO ] [Nat]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 21:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:31:10] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2024-05-28 21:31:10] [INFO ] Computed and/alt/rep : 261/587/261 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-28 21:31:12] [INFO ] Added : 261 causal constraints over 57 iterations in 2459 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-28 21:31:12] [INFO ] Invariant cache hit.
[2024-05-28 21:31:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 21:31:12] [INFO ] Invariant cache hit.
[2024-05-28 21:31:13] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2024-05-28 21:31:13] [INFO ] Invariant cache hit.
[2024-05-28 21:31:13] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 267/267 places, 262/262 transitions.
Computed a total of 59 stabilizing places and 59 stable transitions
Computed a total of 59 stabilizing places and 59 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 21:31:13] [INFO ] Invariant cache hit.
[2024-05-28 21:31:14] [INFO ] [Real]Absence check using 46 positive place invariants in 12 ms returned sat
[2024-05-28 21:31:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:31:14] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2024-05-28 21:31:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:31:14] [INFO ] [Nat]Absence check using 46 positive place invariants in 13 ms returned sat
[2024-05-28 21:31:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:31:14] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2024-05-28 21:31:14] [INFO ] Computed and/alt/rep : 261/587/261 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-28 21:31:17] [INFO ] Added : 261 causal constraints over 57 iterations in 2446 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1145 reset in 192 ms.
Product exploration explored 100000 steps with 1148 reset in 201 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 267 transition count 262
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 24 place count 267 transition count 264
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 35 place count 267 transition count 264
Performed 104 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 139 places in 0 ms
Iterating global reduction 1 with 104 rules applied. Total rules applied 139 place count 267 transition count 264
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 173 place count 233 transition count 230
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 207 place count 233 transition count 230
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 207 rules in 34 ms. Remains 233 /267 variables (removed 34) and now considering 230/262 (removed 32) transitions.
[2024-05-28 21:31:17] [INFO ] Redundant transitions in 22 ms returned [229]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 229 rows 233 cols
[2024-05-28 21:31:17] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 21:31:18] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 233/267 places, 229/262 transitions.
Deduced a syphon composed of 105 places in 0 ms
Applied a total of 0 rules in 5 ms. Remains 233 /233 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 215 ms. Remains : 233/267 places, 229/262 transitions.
Built C files in :
/tmp/ltsmin7685724382794762058
[2024-05-28 21:31:18] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7685724382794762058
Running compilation step : cd /tmp/ltsmin7685724382794762058;'/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 376 ms.
Running link step : cd /tmp/ltsmin7685724382794762058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7685724382794762058;'/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/stateBased10112525748524663660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 262/262 transitions.
Applied a total of 0 rules in 5 ms. Remains 267 /267 variables (removed 0) and now considering 262/262 (removed 0) transitions.
// Phase 1: matrix 262 rows 267 cols
[2024-05-28 21:31:33] [INFO ] Computed 46 invariants in 3 ms
[2024-05-28 21:31:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-28 21:31:33] [INFO ] Invariant cache hit.
[2024-05-28 21:31:33] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-28 21:31:33] [INFO ] Invariant cache hit.
[2024-05-28 21:31:33] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 267/267 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin10598295481105611893
[2024-05-28 21:31:33] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10598295481105611893
Running compilation step : cd /tmp/ltsmin10598295481105611893;'/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 368 ms.
Running link step : cd /tmp/ltsmin10598295481105611893;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin10598295481105611893;'/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/stateBased5081603416627920377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:31:48] [INFO ] Flatten gal took : 10 ms
[2024-05-28 21:31:48] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:31:48] [INFO ] Time to serialize gal into /tmp/LTL4352132995023455342.gal : 2 ms
[2024-05-28 21:31:48] [INFO ] Time to serialize properties into /tmp/LTL12632693764727604870.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/LTL4352132995023455342.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1754262645826256674.hoa' '-atoms' '/tmp/LTL12632693764727604870.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/LTL12632693764727604870.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1754262645826256674.hoa
Detected timeout of ITS tools.
[2024-05-28 21:32:03] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:32:03] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:32:03] [INFO ] Time to serialize gal into /tmp/LTL15985435652451323795.gal : 5 ms
[2024-05-28 21:32:03] [INFO ] Time to serialize properties into /tmp/LTL9786689344949136036.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/LTL15985435652451323795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9786689344949136036.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(X(X(F("(p99==1)"))))))
Formula 0 simplified : XXXG!"(p99==1)"
Detected timeout of ITS tools.
[2024-05-28 21:32:18] [INFO ] Flatten gal took : 22 ms
[2024-05-28 21:32:18] [INFO ] Applying decomposition
[2024-05-28 21:32:18] [INFO ] Flatten gal took : 8 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/graph10812382913964487938.txt' '-o' '/tmp/graph10812382913964487938.bin' '-w' '/tmp/graph10812382913964487938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10812382913964487938.bin' '-l' '-1' '-v' '-w' '/tmp/graph10812382913964487938.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:32:18] [INFO ] Decomposing Gal with order
[2024-05-28 21:32:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:32:18] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-28 21:32:18] [INFO ] Flatten gal took : 14 ms
[2024-05-28 21:32:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:32:18] [INFO ] Time to serialize gal into /tmp/LTL15528865227426739763.gal : 4 ms
[2024-05-28 21:32:18] [INFO ] Time to serialize properties into /tmp/LTL4798180447505044450.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/LTL15528865227426739763.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4798180447505044450.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(X(X(F("(i3.i0.u34.p99==1)"))))))
Formula 0 simplified : XXXG!"(i3.i0.u34.p99==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5329140321516132967
[2024-05-28 21:32:33] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5329140321516132967
Running compilation step : cd /tmp/ltsmin5329140321516132967;'/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 373 ms.
Running link step : cd /tmp/ltsmin5329140321516132967;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5329140321516132967;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 100927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 277 transition count 246
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 251 transition count 246
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 52 place count 251 transition count 220
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 104 place count 225 transition count 220
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 114 place count 215 transition count 210
Iterating global reduction 2 with 10 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 124 place count 215 transition count 207
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 130 place count 212 transition count 207
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 296 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 126 transition count 122
Applied a total of 299 rules in 21 ms. Remains 126 /278 variables (removed 152) and now considering 122/273 (removed 151) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 21:32:49] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:32:49] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 21:32:49] [INFO ] Invariant cache hit.
[2024-05-28 21:32:49] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-28 21:32:49] [INFO ] Redundant transitions in 19 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 21:32:49] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:32:49] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/278 places, 121/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 289 ms. Remains : 126/278 places, 121/273 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s49 1) (NEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1811 reset in 219 ms.
Product exploration explored 100000 steps with 1779 reset in 239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 21:32:50] [INFO ] Invariant cache hit.
[2024-05-28 21:32:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 21:32:50] [INFO ] Invariant cache hit.
[2024-05-28 21:32:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-28 21:32:50] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-28 21:32:50] [INFO ] Invariant cache hit.
[2024-05-28 21:32:50] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 126/126 places, 121/121 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1784 reset in 217 ms.
Product exploration explored 100000 steps with 1813 reset in 239 ms.
Built C files in :
/tmp/ltsmin2101878010794905897
[2024-05-28 21:32:51] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 21:32:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:32:51] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 21:32:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:32:51] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 21:32:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:32:51] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2101878010794905897
Running compilation step : cd /tmp/ltsmin2101878010794905897;'/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 259 ms.
Running link step : cd /tmp/ltsmin2101878010794905897;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2101878010794905897;'/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/stateBased6707015867152041255.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 121/121 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
[2024-05-28 21:33:06] [INFO ] Invariant cache hit.
[2024-05-28 21:33:06] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 21:33:06] [INFO ] Invariant cache hit.
[2024-05-28 21:33:06] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-28 21:33:06] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-28 21:33:06] [INFO ] Invariant cache hit.
[2024-05-28 21:33:06] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 277 ms. Remains : 126/126 places, 121/121 transitions.
Built C files in :
/tmp/ltsmin1906281325483085248
[2024-05-28 21:33:06] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 21:33:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:33:06] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 21:33:06] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:33:06] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 21:33:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:33:06] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1906281325483085248
Running compilation step : cd /tmp/ltsmin1906281325483085248;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin1906281325483085248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1906281325483085248;'/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/stateBased17938805228723465606.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:33:22] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:33:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:33:22] [INFO ] Time to serialize gal into /tmp/LTL6011906128226893756.gal : 3 ms
[2024-05-28 21:33:22] [INFO ] Time to serialize properties into /tmp/LTL13447153578394249956.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/LTL6011906128226893756.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3671233561217917503.hoa' '-atoms' '/tmp/LTL13447153578394249956.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/LTL13447153578394249956.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3671233561217917503.hoa
Detected timeout of ITS tools.
[2024-05-28 21:33:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:33:37] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:33:37] [INFO ] Time to serialize gal into /tmp/LTL8630433794666547027.gal : 1 ms
[2024-05-28 21:33:37] [INFO ] Time to serialize properties into /tmp/LTL11334110543715548905.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/LTL8630433794666547027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11334110543715548905.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("((p116==1)||(p89!=1))"))))
Formula 0 simplified : FG!"((p116==1)||(p89!=1))"
Detected timeout of ITS tools.
[2024-05-28 21:33:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:33:52] [INFO ] Applying decomposition
[2024-05-28 21:33:52] [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/graph5901922125302809188.txt' '-o' '/tmp/graph5901922125302809188.bin' '-w' '/tmp/graph5901922125302809188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5901922125302809188.bin' '-l' '-1' '-v' '-w' '/tmp/graph5901922125302809188.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:33:52] [INFO ] Decomposing Gal with order
[2024-05-28 21:33:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:33:52] [INFO ] Removed a total of 78 redundant transitions.
[2024-05-28 21:33:52] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:33:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2024-05-28 21:33:52] [INFO ] Time to serialize gal into /tmp/LTL11217297515501672603.gal : 2 ms
[2024-05-28 21:33:52] [INFO ] Time to serialize properties into /tmp/LTL3866040998893396475.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/LTL11217297515501672603.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3866040998893396475.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("((i1.i2.u19.p116==1)||(i1.i0.u14.p89!=1))"))))
Formula 0 simplified : FG!"((i1.i2.u19.p116==1)||(i1.i0.u14.p89!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17469655277367889575
[2024-05-28 21:34:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17469655277367889575
Running compilation step : cd /tmp/ltsmin17469655277367889575;'/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 224 ms.
Running link step : cd /tmp/ltsmin17469655277367889575;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17469655277367889575;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-11 finished in 93314 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)))'
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 268 transition count 263
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 268 transition count 263
Applied a total of 20 rules in 6 ms. Remains 268 /278 variables (removed 10) and now considering 263/273 (removed 10) transitions.
// Phase 1: matrix 263 rows 268 cols
[2024-05-28 21:34:22] [INFO ] Computed 46 invariants in 1 ms
[2024-05-28 21:34:22] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 21:34:22] [INFO ] Invariant cache hit.
[2024-05-28 21:34:22] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2024-05-28 21:34:22] [INFO ] Invariant cache hit.
[2024-05-28 21:34:22] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 268/278 places, 263/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 268/278 places, 263/273 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s21 1), p0:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-12 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 252 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 124 place count 215 transition count 206
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 132 place count 211 transition count 206
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 298 place count 128 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 126 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 301 place count 125 transition count 121
Applied a total of 301 rules in 17 ms. Remains 125 /278 variables (removed 153) and now considering 121/273 (removed 152) transitions.
// Phase 1: matrix 121 rows 125 cols
[2024-05-28 21:34:22] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:34:23] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-28 21:34:23] [INFO ] Invariant cache hit.
[2024-05-28 21:34:23] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2024-05-28 21:34:23] [INFO ] Redundant transitions in 29 ms returned [120]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 120 rows 125 cols
[2024-05-28 21:34:23] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:34:23] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/278 places, 120/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 125 /125 variables (removed 0) and now considering 120/120 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 327 ms. Remains : 125/278 places, 120/273 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s85 1) (EQ s92 1) (EQ s102 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 303 steps with 0 reset in 2 ms.
FORMULA ShieldIIPs-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPs-PT-005B-LTLFireability-14 finished in 389 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||G(p1)))))'
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 50 place count 252 transition count 222
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 100 place count 227 transition count 222
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 111 place count 216 transition count 211
Iterating global reduction 2 with 11 rules applied. Total rules applied 122 place count 216 transition count 211
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 122 place count 216 transition count 207
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 130 place count 212 transition count 207
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 290 place count 132 transition count 127
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 292 place count 130 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 129 transition count 125
Applied a total of 293 rules in 24 ms. Remains 129 /278 variables (removed 149) and now considering 125/273 (removed 148) transitions.
// Phase 1: matrix 125 rows 129 cols
[2024-05-28 21:34:23] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:34:23] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 21:34:23] [INFO ] Invariant cache hit.
[2024-05-28 21:34:23] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-28 21:34:23] [INFO ] Redundant transitions in 25 ms returned [124]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 124 rows 129 cols
[2024-05-28 21:34:23] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:34:23] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/278 places, 124/273 transitions.
Applied a total of 0 rules in 1 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 317 ms. Remains : 129/278 places, 124/273 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s54 1) (EQ s5 1)), p0:(NEQ s106 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6076 reset in 209 ms.
Product exploration explored 100000 steps with 6131 reset in 230 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :1
Finished Best-First random walk after 377 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=188 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 21:34:24] [INFO ] Invariant cache hit.
[2024-05-28 21:34:24] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 21:34:24] [INFO ] Invariant cache hit.
[2024-05-28 21:34:25] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-28 21:34:25] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-28 21:34:25] [INFO ] Invariant cache hit.
[2024-05-28 21:34:25] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 129/129 places, 124/124 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Finished Best-First random walk after 5803 steps, including 3 resets, run visited all 1 properties in 8 ms. (steps per millisecond=725 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 3 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6175 reset in 204 ms.
Product exploration explored 100000 steps with 6084 reset in 230 ms.
Built C files in :
/tmp/ltsmin13593832582531041565
[2024-05-28 21:34:26] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-28 21:34:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:34:26] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-28 21:34:26] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:34:26] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-28 21:34:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:34:26] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13593832582531041565
Running compilation step : cd /tmp/ltsmin13593832582531041565;'/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 269 ms.
Running link step : cd /tmp/ltsmin13593832582531041565;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13593832582531041565;'/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/stateBased7296691538872636423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 124/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 129 /129 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 21:34:41] [INFO ] Invariant cache hit.
[2024-05-28 21:34:41] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 21:34:41] [INFO ] Invariant cache hit.
[2024-05-28 21:34:41] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-28 21:34:41] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-28 21:34:41] [INFO ] Invariant cache hit.
[2024-05-28 21:34:41] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 129/129 places, 124/124 transitions.
Built C files in :
/tmp/ltsmin1302500868174502107
[2024-05-28 21:34:41] [INFO ] Computing symmetric may disable matrix : 124 transitions.
[2024-05-28 21:34:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:34:41] [INFO ] Computing symmetric may enable matrix : 124 transitions.
[2024-05-28 21:34:41] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:34:41] [INFO ] Computing Do-Not-Accords matrix : 124 transitions.
[2024-05-28 21:34:41] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:34:41] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1302500868174502107
Running compilation step : cd /tmp/ltsmin1302500868174502107;'/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 244 ms.
Running link step : cd /tmp/ltsmin1302500868174502107;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin1302500868174502107;'/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/stateBased2353226937192234648.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:34:56] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:34:56] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:34:56] [INFO ] Time to serialize gal into /tmp/LTL4966056999506960253.gal : 1 ms
[2024-05-28 21:34:56] [INFO ] Time to serialize properties into /tmp/LTL17663433540181264908.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/LTL4966056999506960253.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7199002186025026257.hoa' '-atoms' '/tmp/LTL17663433540181264908.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/LTL17663433540181264908.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7199002186025026257.hoa
Detected timeout of ITS tools.
[2024-05-28 21:35:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:35:12] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:35:12] [INFO ] Time to serialize gal into /tmp/LTL5147251463943840683.gal : 2 ms
[2024-05-28 21:35:12] [INFO ] Time to serialize properties into /tmp/LTL7387703166809362465.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/LTL5147251463943840683.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7387703166809362465.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p242!=1)")||(G("((p133==1)&&(p21==1))"))))))
Formula 0 simplified : G(F!"((p133==1)&&(p21==1))" & FG!"(p242!=1)")
Detected timeout of ITS tools.
[2024-05-28 21:35:27] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:35:27] [INFO ] Applying decomposition
[2024-05-28 21:35:27] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7136532102633867902.txt' '-o' '/tmp/graph7136532102633867902.bin' '-w' '/tmp/graph7136532102633867902.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7136532102633867902.bin' '-l' '-1' '-v' '-w' '/tmp/graph7136532102633867902.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:35:27] [INFO ] Decomposing Gal with order
[2024-05-28 21:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:35:27] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 21:35:27] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:35:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 1 ms.
[2024-05-28 21:35:27] [INFO ] Time to serialize gal into /tmp/LTL1478799623882524025.gal : 1 ms
[2024-05-28 21:35:27] [INFO ] Time to serialize properties into /tmp/LTL2482254490781240272.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/LTL1478799623882524025.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2482254490781240272.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 : !((G(F(("(i3.i2.u39.p242!=1)")||(G("((i2.i1.u20.p133==1)&&(i0.i1.u3.p21==1))"))))))
Formula 0 simplified : G(F!"((i2.i1.u20.p133==1)&&(i0.i1.u3.p21==1))" & FG!"(i3.i2.u39.p242!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7364993487715709859
[2024-05-28 21:35:42] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7364993487715709859
Running compilation step : cd /tmp/ltsmin7364993487715709859;'/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 220 ms.
Running link step : cd /tmp/ltsmin7364993487715709859;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7364993487715709859;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-15 finished in 93889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)||G(p2)))'
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(p0))||G(p1)||F(p2)))'
Found a Shortening insensitive property : ShieldIIPs-PT-005B-LTLFireability-05
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Support contains 4 out of 278 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 277 transition count 248
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 253 transition count 248
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 48 place count 253 transition count 221
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 112 place count 216 transition count 211
Iterating global reduction 2 with 10 rules applied. Total rules applied 122 place count 216 transition count 211
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 122 place count 216 transition count 208
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 128 place count 213 transition count 208
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 2 with 164 rules applied. Total rules applied 292 place count 131 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 129 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 128 transition count 124
Applied a total of 295 rules in 23 ms. Remains 128 /278 variables (removed 150) and now considering 124/273 (removed 149) transitions.
// Phase 1: matrix 124 rows 128 cols
[2024-05-28 21:35:57] [INFO ] Computed 45 invariants in 2 ms
[2024-05-28 21:35:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 21:35:57] [INFO ] Invariant cache hit.
[2024-05-28 21:35:57] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-28 21:35:57] [INFO ] Invariant cache hit.
[2024-05-28 21:35:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 128/278 places, 124/273 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 255 ms. Remains : 128/278 places, 124/273 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s108 1) (EQ s119 1)), p0:(EQ s105 1), p1:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24477 reset in 189 ms.
Product exploration explored 100000 steps with 24538 reset in 213 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/124 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 552 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 570 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-28 21:35:59] [INFO ] Invariant cache hit.
[2024-05-28 21:35:59] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:35:59] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-28 21:35:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:35:59] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:35:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:35:59] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-28 21:35:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-28 21:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-28 21:35:59] [INFO ] Computed and/alt/rep : 120/299/120 causal constraints (skipped 1 transitions) in 9 ms.
[2024-05-28 21:35:59] [INFO ] Added : 80 causal constraints over 16 iterations in 206 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 3 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 124/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 124/124 (removed 0) transitions.
[2024-05-28 21:35:59] [INFO ] Invariant cache hit.
[2024-05-28 21:36:00] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-28 21:36:00] [INFO ] Invariant cache hit.
[2024-05-28 21:36:00] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-28 21:36:00] [INFO ] Redundant transitions in 22 ms returned [123]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 123 rows 128 cols
[2024-05-28 21:36:00] [INFO ] Computed 45 invariants in 0 ms
[2024-05-28 21:36:00] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/128 places, 123/124 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 281 ms. Remains : 128/128 places, 123/124 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/128 stabilizing places and 4/123 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p2))]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
[2024-05-28 21:36:00] [INFO ] Invariant cache hit.
[2024-05-28 21:36:00] [INFO ] [Real]Absence check using 45 positive place invariants in 7 ms returned sat
[2024-05-28 21:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:36:00] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 21:36:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:36:00] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:36:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:36:00] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-28 21:36:00] [INFO ] Computed and/alt/rep : 119/294/119 causal constraints (skipped 1 transitions) in 8 ms.
[2024-05-28 21:36:01] [INFO ] Added : 100 causal constraints over 20 iterations in 256 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 24704 reset in 187 ms.
Product exploration explored 100000 steps with 24504 reset in 214 ms.
Built C files in :
/tmp/ltsmin8131449338277484756
[2024-05-28 21:36:01] [INFO ] Computing symmetric may disable matrix : 123 transitions.
[2024-05-28 21:36:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:36:01] [INFO ] Computing symmetric may enable matrix : 123 transitions.
[2024-05-28 21:36:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:36:01] [INFO ] Computing Do-Not-Accords matrix : 123 transitions.
[2024-05-28 21:36:01] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:36:01] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8131449338277484756
Running compilation step : cd /tmp/ltsmin8131449338277484756;'/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 253 ms.
Running link step : cd /tmp/ltsmin8131449338277484756;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8131449338277484756;'/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/stateBased11845815075762699360.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 123/123 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 126 transition count 121
Applied a total of 1 rules in 7 ms. Remains 126 /128 variables (removed 2) and now considering 121/123 (removed 2) transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 21:36:16] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:36:16] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 21:36:16] [INFO ] Invariant cache hit.
[2024-05-28 21:36:17] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-28 21:36:17] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-28 21:36:17] [INFO ] Invariant cache hit.
[2024-05-28 21:36:17] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/128 places, 121/123 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 301 ms. Remains : 126/128 places, 121/123 transitions.
Built C files in :
/tmp/ltsmin14218046501093648455
[2024-05-28 21:36:17] [INFO ] Computing symmetric may disable matrix : 121 transitions.
[2024-05-28 21:36:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:36:17] [INFO ] Computing symmetric may enable matrix : 121 transitions.
[2024-05-28 21:36:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:36:17] [INFO ] Computing Do-Not-Accords matrix : 121 transitions.
[2024-05-28 21:36:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:36:17] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14218046501093648455
Running compilation step : cd /tmp/ltsmin14218046501093648455;'/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 240 ms.
Running link step : cd /tmp/ltsmin14218046501093648455;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14218046501093648455;'/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/stateBased2131176732018633498.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:36:32] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:36:32] [INFO ] Time to serialize gal into /tmp/LTL3530981434453982491.gal : 1 ms
[2024-05-28 21:36:32] [INFO ] Time to serialize properties into /tmp/LTL2561747461786665751.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/LTL3530981434453982491.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6443891665643121258.hoa' '-atoms' '/tmp/LTL2561747461786665751.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL2561747461786665751.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6443891665643121258.hoa
Detected timeout of ITS tools.
[2024-05-28 21:36:47] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:36:47] [INFO ] Flatten gal took : 5 ms
[2024-05-28 21:36:47] [INFO ] Time to serialize gal into /tmp/LTL17571044808640423639.gal : 1 ms
[2024-05-28 21:36:47] [INFO ] Time to serialize properties into /tmp/LTL682205757438552340.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/LTL17571044808640423639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL682205757438552340.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(F("(p251==1)")))||(G("(p159==1)")))||(F("((p255==1)&&(p280==1))"))))
Formula 0 simplified : XG!"(p251==1)" & F!"(p159==1)" & G!"((p255==1)&&(p280==1))"
Detected timeout of ITS tools.
[2024-05-28 21:37:02] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:37:02] [INFO ] Applying decomposition
[2024-05-28 21:37:02] [INFO ] Flatten gal took : 3 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/graph4619832193064278970.txt' '-o' '/tmp/graph4619832193064278970.bin' '-w' '/tmp/graph4619832193064278970.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4619832193064278970.bin' '-l' '-1' '-v' '-w' '/tmp/graph4619832193064278970.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:37:02] [INFO ] Decomposing Gal with order
[2024-05-28 21:37:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:37:02] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-28 21:37:02] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:37:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 2 ms.
[2024-05-28 21:37:02] [INFO ] Time to serialize gal into /tmp/LTL5522766311638578357.gal : 8 ms
[2024-05-28 21:37:02] [INFO ] Time to serialize properties into /tmp/LTL1758115923109207150.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/LTL5522766311638578357.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1758115923109207150.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(F("(i4.i0.u38.p251==1)")))||(G("(i2.i1.u25.p159==1)")))||(F("((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"))))
Formula 0 simplified : XG!"(i4.i0.u38.p251==1)" & F!"(i2.i1.u25.p159==1)" & G!"((i4.i0.u40.p255==1)&&(i4.i0.u44.p280==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3258362873527228009
[2024-05-28 21:37:17] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3258362873527228009
Running compilation step : cd /tmp/ltsmin3258362873527228009;'/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 211 ms.
Running link step : cd /tmp/ltsmin3258362873527228009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3258362873527228009;'/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)))||[]((LTLAPp1==true))||<>((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-05 finished in 95190 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(p1)))'
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(X(F(p0)))))'
Found a Shortening insensitive property : ShieldIIPs-PT-005B-LTLFireability-10
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 278/278 places, 273/273 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 277 transition count 247
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 252 transition count 247
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 50 place count 252 transition count 221
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 102 place count 226 transition count 221
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 113 place count 215 transition count 210
Iterating global reduction 2 with 11 rules applied. Total rules applied 124 place count 215 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 124 place count 215 transition count 207
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 130 place count 212 transition count 207
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 296 place count 129 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 298 place count 127 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 126 transition count 122
Applied a total of 299 rules in 18 ms. Remains 126 /278 variables (removed 152) and now considering 122/273 (removed 151) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 21:37:32] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:37:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 21:37:32] [INFO ] Invariant cache hit.
[2024-05-28 21:37:33] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-28 21:37:33] [INFO ] Invariant cache hit.
[2024-05-28 21:37:33] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 126/278 places, 122/273 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 298 ms. Remains : 126/278 places, 122/273 transitions.
Running random walk in product with property : ShieldIIPs-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(EQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1954 reset in 223 ms.
Product exploration explored 100000 steps with 1928 reset in 254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 21:37:34] [INFO ] Invariant cache hit.
[2024-05-28 21:37:34] [INFO ] [Real]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:37:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:37:34] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-28 21:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:37:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:37:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:37:34] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-28 21:37:34] [INFO ] Computed and/alt/rep : 120/296/120 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 21:37:34] [INFO ] Added : 103 causal constraints over 22 iterations in 275 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 21:37:34] [INFO ] Invariant cache hit.
[2024-05-28 21:37:34] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-28 21:37:34] [INFO ] Invariant cache hit.
[2024-05-28 21:37:35] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-28 21:37:35] [INFO ] Invariant cache hit.
[2024-05-28 21:37:35] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 126/126 places, 122/122 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-28 21:37:35] [INFO ] Invariant cache hit.
[2024-05-28 21:37:35] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-28 21:37:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 21:37:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-28 21:37:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 21:37:36] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-28 21:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 21:37:36] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-28 21:37:36] [INFO ] Computed and/alt/rep : 120/296/120 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-28 21:37:36] [INFO ] Added : 103 causal constraints over 22 iterations in 278 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1984 reset in 228 ms.
Product exploration explored 100000 steps with 1896 reset in 254 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2024-05-28 21:37:37] [INFO ] Redundant transitions in 20 ms returned [121]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 121 rows 126 cols
[2024-05-28 21:37:37] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:37:37] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/126 places, 121/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 126 /126 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 106 ms. Remains : 126/126 places, 121/122 transitions.
Built C files in :
/tmp/ltsmin1628052754043924622
[2024-05-28 21:37:37] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1628052754043924622
Running compilation step : cd /tmp/ltsmin1628052754043924622;'/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 212 ms.
Running link step : cd /tmp/ltsmin1628052754043924622;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1628052754043924622;'/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/stateBased4975101718077394987.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 126/126 places, 122/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 126 /126 variables (removed 0) and now considering 122/122 (removed 0) transitions.
// Phase 1: matrix 122 rows 126 cols
[2024-05-28 21:37:52] [INFO ] Computed 45 invariants in 1 ms
[2024-05-28 21:37:52] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-28 21:37:52] [INFO ] Invariant cache hit.
[2024-05-28 21:37:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-28 21:37:52] [INFO ] Invariant cache hit.
[2024-05-28 21:37:52] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 126/126 places, 122/122 transitions.
Built C files in :
/tmp/ltsmin7679962586659717459
[2024-05-28 21:37:52] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7679962586659717459
Running compilation step : cd /tmp/ltsmin7679962586659717459;'/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 222 ms.
Running link step : cd /tmp/ltsmin7679962586659717459;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7679962586659717459;'/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/stateBased17407113823478862954.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 21:38:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:38:07] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:38:07] [INFO ] Time to serialize gal into /tmp/LTL9468424331672239778.gal : 1 ms
[2024-05-28 21:38:07] [INFO ] Time to serialize properties into /tmp/LTL5776961888238468946.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/LTL9468424331672239778.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10313049857938198060.hoa' '-atoms' '/tmp/LTL5776961888238468946.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/LTL5776961888238468946.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10313049857938198060.hoa
Detected timeout of ITS tools.
[2024-05-28 21:38:22] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:38:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 21:38:22] [INFO ] Time to serialize gal into /tmp/LTL14505350313035702705.gal : 5 ms
[2024-05-28 21:38:22] [INFO ] Time to serialize properties into /tmp/LTL422860263574914699.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/LTL14505350313035702705.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL422860263574914699.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(X(X(F("(p99==1)"))))))
Formula 0 simplified : XXXG!"(p99==1)"
Detected timeout of ITS tools.
[2024-05-28 21:38:37] [INFO ] Flatten gal took : 7 ms
[2024-05-28 21:38:37] [INFO ] Applying decomposition
[2024-05-28 21:38:37] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph16822527153258646568.txt' '-o' '/tmp/graph16822527153258646568.bin' '-w' '/tmp/graph16822527153258646568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16822527153258646568.bin' '-l' '-1' '-v' '-w' '/tmp/graph16822527153258646568.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:38:37] [INFO ] Decomposing Gal with order
[2024-05-28 21:38:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:38:37] [INFO ] Removed a total of 79 redundant transitions.
[2024-05-28 21:38:37] [INFO ] Flatten gal took : 9 ms
[2024-05-28 21:38:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 2 ms.
[2024-05-28 21:38:38] [INFO ] Time to serialize gal into /tmp/LTL14728317186978512415.gal : 2 ms
[2024-05-28 21:38:38] [INFO ] Time to serialize properties into /tmp/LTL5094372815851783675.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/LTL14728317186978512415.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5094372815851783675.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(X(X(F("(i1.i1.u16.p99==1)"))))))
Formula 0 simplified : XXXG!"(i1.i1.u16.p99==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8529476407580367330
[2024-05-28 21:38:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8529476407580367330
Running compilation step : cd /tmp/ltsmin8529476407580367330;'/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 239 ms.
Running link step : cd /tmp/ltsmin8529476407580367330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8529476407580367330;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldIIPs-PT-005B-LTLFireability-10 finished in 95468 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)))'
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||G(p1)))))'
[2024-05-28 21:39:08] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10463908168637987869
[2024-05-28 21:39:08] [INFO ] Computing symmetric may disable matrix : 273 transitions.
[2024-05-28 21:39:08] [INFO ] Applying decomposition
[2024-05-28 21:39:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:39:08] [INFO ] Computing symmetric may enable matrix : 273 transitions.
[2024-05-28 21:39:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:39:08] [INFO ] Flatten gal took : 6 ms
[2024-05-28 21:39:08] [INFO ] Computing Do-Not-Accords matrix : 273 transitions.
[2024-05-28 21:39:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 21:39:08] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10463908168637987869
Running compilation step : cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9516792798833795171.txt' '-o' '/tmp/graph9516792798833795171.bin' '-w' '/tmp/graph9516792798833795171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9516792798833795171.bin' '-l' '-1' '-v' '-w' '/tmp/graph9516792798833795171.weights' '-q' '0' '-e' '0.001'
[2024-05-28 21:39:08] [INFO ] Decomposing Gal with order
[2024-05-28 21:39:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 21:39:08] [INFO ] Removed a total of 115 redundant transitions.
[2024-05-28 21:39:08] [INFO ] Flatten gal took : 13 ms
[2024-05-28 21:39:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 21:39:08] [INFO ] Time to serialize gal into /tmp/LTLFireability12671644731104459173.gal : 3 ms
[2024-05-28 21:39:08] [INFO ] Time to serialize properties into /tmp/LTLFireability5211146407621826106.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/LTLFireability12671644731104459173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5211146407621826106.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((((F("(i4.u33.p100==1)"))U("(i3.u34.p101==1)"))||(G("(((i9.u90.p267==0)||(i9.u95.p286==0))||(i10.u98.p297==0))"))))
Formula 0 simplified : (G!"(i4.u33.p100==1)" R !"(i3.u34.p101==1)") & F!"(((i9.u90.p267==0)||(i9.u95.p286==0))||(i10.u98.p297==0))"
Compilation finished in 525 ms.
Running link step : cd /tmp/ltsmin10463908168637987869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '((<>((LTLAPp0==true)) U (LTLAPp1==true))||[]((LTLAPp2==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))||<>((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(<>((LTLAPp3==true)))||[]((LTLAPp4==true))||<>((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp6==true)) U []((LTLAPp7==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 22:03:42] [INFO ] Applying decomposition
[2024-05-28 22:03:42] [INFO ] Flatten gal took : 21 ms
[2024-05-28 22:03:42] [INFO ] Decomposing Gal with order
[2024-05-28 22:03:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 22:03:42] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-28 22:03:42] [INFO ] Flatten gal took : 42 ms
[2024-05-28 22:03:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 5 ms.
[2024-05-28 22:03:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13078986668210786821.gal : 3 ms
[2024-05-28 22:03:43] [INFO ] Time to serialize properties into /tmp/LTLFireability1065428872067967242.ltl : 87 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/LTLFireability13078986668210786821.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1065428872067967242.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((((F("(i0.i0.i0.i1.i0.i0.i0.u36.p100==1)"))U("(i0.i0.i0.i1.i0.i0.u37.p101==1)"))||(G("(((i1.i0.i0.i0.i0.u86.p267==0)||(i1.i0.u89.p28...185
Formula 0 simplified : (G!"(i0.i0.i0.i1.i0.i0.i0.u36.p100==1)" R !"(i0.i0.i0.i1.i0.i0.u37.p101==1)") & F!"(((i1.i0.i0.i0.i0.u86.p267==0)||(i1.i0.u89.p286==...178
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp6==true)) U []((LTLAPp7==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp8==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(<>((LTLAPp8==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10463908168637987869;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp9==true)))' '--buchi-type=spotba'
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 190864 kB
After kill :
MemTotal: 16393232 kB
MemFree: 15983340 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPs-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is ShieldIIPs-PT-005B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788400048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-005B.tgz
mv ShieldIIPs-PT-005B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;