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-171683789100378.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 ShieldPPPt-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-171683789100378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.5K 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 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 14:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 92K 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 ShieldPPPt-PT-005B-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-005B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716983764450

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=ShieldPPPt-PT-005B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 11:56:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 11:56:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 11:56:06] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-29 11:56:06] [INFO ] Transformed 393 places.
[2024-05-29 11:56:06] [INFO ] Transformed 358 transitions.
[2024-05-29 11:56:06] [INFO ] Found NUPN structural information;
[2024-05-29 11:56:06] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 41 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 358/358 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 348 transition count 313
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 348 transition count 313
Applied a total of 90 rules in 65 ms. Remains 348 /393 variables (removed 45) and now considering 313/358 (removed 45) transitions.
// Phase 1: matrix 313 rows 348 cols
[2024-05-29 11:56:06] [INFO ] Computed 56 invariants in 20 ms
[2024-05-29 11:56:07] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-29 11:56:07] [INFO ] Invariant cache hit.
[2024-05-29 11:56:07] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-29 11:56:07] [INFO ] Invariant cache hit.
[2024-05-29 11:56:07] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 348/393 places, 313/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 348/393 places, 313/358 transitions.
Support contains 41 out of 348 places after structural reductions.
[2024-05-29 11:56:07] [INFO ] Flatten gal took : 50 ms
[2024-05-29 11:56:07] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:56:07] [INFO ] Input system was already deterministic with 313 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 246 ms. (steps per millisecond=40 ) properties (out of 37) seen :36
Finished Best-First random walk after 2653 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=379 )
Parikh walk visited 0 properties in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 83 stabilizing places and 83 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 347 transition count 237
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 150 place count 272 transition count 237
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 150 place count 272 transition count 203
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 218 place count 238 transition count 203
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 224 place count 232 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 230 place count 232 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 230 place count 232 transition count 193
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 238 place count 228 transition count 193
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 406 place count 144 transition count 109
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 436 place count 129 transition count 109
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 438 place count 127 transition count 107
Applied a total of 438 rules in 64 ms. Remains 127 /348 variables (removed 221) and now considering 107/313 (removed 206) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 11:56:08] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 11:56:08] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 11:56:08] [INFO ] Invariant cache hit.
[2024-05-29 11:56:09] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-29 11:56:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 11:56:09] [INFO ] Invariant cache hit.
[2024-05-29 11:56:09] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/348 places, 107/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 127/348 places, 107/313 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 211 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-00 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 s118 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 1197 reset in 425 ms.
Stack based approach found an accepted trace after 120 steps with 1 reset with depth 57 and stack size 57 in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-00 finished in 1066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 339 transition count 304
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Applied a total of 22 rules in 27 ms. Remains 337 /348 variables (removed 11) and now considering 302/313 (removed 11) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 11:56:09] [INFO ] Computed 56 invariants in 7 ms
[2024-05-29 11:56:09] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 11:56:09] [INFO ] Invariant cache hit.
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-05-29 11:56:10] [INFO ] Invariant cache hit.
[2024-05-29 11:56:10] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/348 places, 302/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 337/348 places, 302/313 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s316 1), p1:(EQ s109 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 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-01 finished in 732 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 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 347 transition count 237
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 151 place count 272 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 271 transition count 236
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 152 place count 271 transition count 202
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 220 place count 237 transition count 202
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 226 place count 231 transition count 196
Iterating global reduction 3 with 6 rules applied. Total rules applied 232 place count 231 transition count 196
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 232 place count 231 transition count 192
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 240 place count 227 transition count 192
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 3 with 168 rules applied. Total rules applied 408 place count 143 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 409 place count 143 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 411 place count 142 transition count 106
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 437 place count 129 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 439 place count 127 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 440 place count 126 transition count 104
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 440 place count 126 transition count 102
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 444 place count 124 transition count 102
Applied a total of 444 rules in 51 ms. Remains 124 /348 variables (removed 224) and now considering 102/313 (removed 211) transitions.
// Phase 1: matrix 102 rows 124 cols
[2024-05-29 11:56:10] [INFO ] Computed 55 invariants in 2 ms
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants in 90 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 95 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/348 places, 102/313 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 100
Applied a total of 4 rules in 6 ms. Remains 120 /122 variables (removed 2) and now considering 100/102 (removed 2) transitions.
// Phase 1: matrix 100 rows 120 cols
[2024-05-29 11:56:10] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-29 11:56:10] [INFO ] Invariant cache hit.
[2024-05-29 11:56:10] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/348 places, 100/313 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 320 ms. Remains : 120/348 places, 100/313 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-02 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 s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Stack based approach found an accepted trace after 38 steps with 0 reset with depth 39 and stack size 39 in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-02 finished in 662 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((X(p0)&&(p1||F(G(p2)))))))'
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 339 transition count 304
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Applied a total of 22 rules in 21 ms. Remains 337 /348 variables (removed 11) and now considering 302/313 (removed 11) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 11:56:11] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 11:56:11] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 11:56:11] [INFO ] Invariant cache hit.
[2024-05-29 11:56:11] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-05-29 11:56:11] [INFO ] Invariant cache hit.
[2024-05-29 11:56:11] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/348 places, 302/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 530 ms. Remains : 337/348 places, 302/313 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s182 1), p0:(EQ s182 0), p2:(EQ s71 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 247 ms.
Stack based approach found an accepted trace after 3666 steps with 0 reset with depth 3667 and stack size 3665 in 12 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-03 finished in 1018 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)&&((F(p1)||X(G(p2))) U (p3||X(p3))))))'
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 340 transition count 305
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 340 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 339 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 338 transition count 303
Applied a total of 20 rules in 21 ms. Remains 338 /348 variables (removed 10) and now considering 303/313 (removed 10) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 11:56:12] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 11:56:12] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 11:56:12] [INFO ] Invariant cache hit.
[2024-05-29 11:56:12] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-29 11:56:12] [INFO ] Invariant cache hit.
[2024-05-29 11:56:12] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/348 places, 303/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 338/348 places, 303/313 transitions.
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s282 1) (EQ s333 1)), p3:(EQ s109 1), p1:(EQ s65 1), p2:(AND (EQ s22 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1026 reset in 221 ms.
Stack based approach found an accepted trace after 386 steps with 4 reset with depth 131 and stack size 131 in 1 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-04 finished in 1352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((p1&&F(p2)))||G(p3))))'
Support contains 6 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 347 transition count 235
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 270 transition count 235
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 154 place count 270 transition count 204
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 216 place count 239 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 221 place count 234 transition count 199
Iterating global reduction 2 with 5 rules applied. Total rules applied 226 place count 234 transition count 199
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 226 place count 234 transition count 196
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 232 place count 231 transition count 196
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 398 place count 148 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 148 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 401 place count 147 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 429 place count 133 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 431 place count 131 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 432 place count 130 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 432 place count 130 transition count 107
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 436 place count 128 transition count 107
Applied a total of 436 rules in 41 ms. Remains 128 /348 variables (removed 220) and now considering 107/313 (removed 206) transitions.
// Phase 1: matrix 107 rows 128 cols
[2024-05-29 11:56:13] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 11:56:13] [INFO ] Implicit Places using invariants in 71 ms returned [111, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 72 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/348 places, 107/313 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 105
Applied a total of 4 rules in 5 ms. Remains 124 /126 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 124 cols
[2024-05-29 11:56:13] [INFO ] Computed 53 invariants in 3 ms
[2024-05-29 11:56:13] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 11:56:13] [INFO ] Invariant cache hit.
[2024-05-29 11:56:13] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/348 places, 105/313 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 332 ms. Remains : 124/348 places, 105/313 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p3), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s6 0) (EQ s22 0)), p0:(AND (EQ s68 1) (EQ s80 1)), p3:(EQ s103 1), p2:(EQ s102 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3552 reset in 247 ms.
Stack based approach found an accepted trace after 8254 steps with 310 reset with depth 39 and stack size 33 in 23 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-05 finished in 707 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(X((p0 U X((G(p0) U p1))))))))'
Support contains 4 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 338 transition count 303
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 336 transition count 301
Applied a total of 24 rules in 19 ms. Remains 336 /348 variables (removed 12) and now considering 301/313 (removed 12) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 11:56:14] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 11:56:14] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-29 11:56:14] [INFO ] Invariant cache hit.
[2024-05-29 11:56:14] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-05-29 11:56:14] [INFO ] Invariant cache hit.
[2024-05-29 11:56:14] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/348 places, 301/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 539 ms. Remains : 336/348 places, 301/313 transitions.
Stuttering acceptance computed with spot in 358 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s286 1) (EQ s310 1)), p1:(AND (EQ s103 1) (EQ s105 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-06 finished in 926 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((F(G(p0)) U p1))))'
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 339 transition count 304
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Applied a total of 22 rules in 19 ms. Remains 337 /348 variables (removed 11) and now considering 302/313 (removed 11) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 11:56:15] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 11:56:15] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 11:56:15] [INFO ] Invariant cache hit.
[2024-05-29 11:56:15] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-29 11:56:15] [INFO ] Invariant cache hit.
[2024-05-29 11:56:15] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 337/348 places, 302/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 560 ms. Remains : 337/348 places, 302/313 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s0 1), p0:(EQ s67 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 235 ms.
Product exploration explored 100000 steps with 0 reset in 275 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/337 stabilizing places and 78/302 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 1527 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=80 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 145 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-29 11:56:17] [INFO ] Invariant cache hit.
[2024-05-29 11:56:17] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-29 11:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:56:17] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-29 11:56:17] [INFO ] Computed and/alt/rep : 301/447/301 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-29 11:56:17] [INFO ] Added : 0 causal constraints over 0 iterations in 67 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 302/302 transitions.
Applied a total of 0 rules in 3 ms. Remains 337 /337 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2024-05-29 11:56:17] [INFO ] Invariant cache hit.
[2024-05-29 11:56:17] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 11:56:17] [INFO ] Invariant cache hit.
[2024-05-29 11:56:17] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2024-05-29 11:56:17] [INFO ] Invariant cache hit.
[2024-05-29 11:56:18] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 460 ms. Remains : 337/337 places, 302/302 transitions.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/337 stabilizing places and 78/302 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 269 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 2944 steps, including 0 resets, run visited all 2 properties in 20 ms. (steps per millisecond=147 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 176 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-29 11:56:19] [INFO ] Invariant cache hit.
[2024-05-29 11:56:19] [INFO ] [Real]Absence check using 56 positive place invariants in 12 ms returned sat
[2024-05-29 11:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:56:19] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2024-05-29 11:56:19] [INFO ] Computed and/alt/rep : 301/447/301 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-29 11:56:19] [INFO ] Added : 0 causal constraints over 0 iterations in 59 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 246 ms.
Product exploration explored 100000 steps with 0 reset in 333 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 337/337 places, 302/302 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 337 transition count 302
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 69 place count 337 transition count 323
Deduced a syphon composed of 95 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 95 place count 337 transition count 323
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 190 places in 0 ms
Iterating global reduction 1 with 95 rules applied. Total rules applied 190 place count 337 transition count 323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 191 place count 337 transition count 322
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 227 place count 301 transition count 286
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 263 place count 301 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 155 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 301 transition count 286
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 266 place count 299 transition count 284
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 268 place count 299 transition count 284
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -79
Deduced a syphon composed of 172 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 287 place count 299 transition count 363
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 307 place count 279 transition count 323
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 327 place count 279 transition count 323
Deduced a syphon composed of 152 places in 0 ms
Applied a total of 327 rules in 76 ms. Remains 279 /337 variables (removed 58) and now considering 323/302 (removed -21) transitions.
[2024-05-29 11:56:20] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 323 rows 279 cols
[2024-05-29 11:56:20] [INFO ] Computed 56 invariants in 3 ms
[2024-05-29 11:56:20] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/337 places, 323/302 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 279/337 places, 323/302 transitions.
Built C files in :
/tmp/ltsmin3553542825553317834
[2024-05-29 11:56:20] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3553542825553317834
Running compilation step : cd /tmp/ltsmin3553542825553317834;'/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 562 ms.
Running link step : cd /tmp/ltsmin3553542825553317834;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3553542825553317834;'/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/stateBased95500338148220986.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 337 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 337/337 places, 302/302 transitions.
Applied a total of 0 rules in 18 ms. Remains 337 /337 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 11:56:35] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 11:56:36] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 11:56:36] [INFO ] Invariant cache hit.
[2024-05-29 11:56:36] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2024-05-29 11:56:36] [INFO ] Invariant cache hit.
[2024-05-29 11:56:36] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 337/337 places, 302/302 transitions.
Built C files in :
/tmp/ltsmin17707853358156320674
[2024-05-29 11:56:36] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17707853358156320674
Running compilation step : cd /tmp/ltsmin17707853358156320674;'/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 421 ms.
Running link step : cd /tmp/ltsmin17707853358156320674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin17707853358156320674;'/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/stateBased13114232525276336507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:56:51] [INFO ] Flatten gal took : 15 ms
[2024-05-29 11:56:51] [INFO ] Flatten gal took : 14 ms
[2024-05-29 11:56:51] [INFO ] Time to serialize gal into /tmp/LTL8782728901541132143.gal : 4 ms
[2024-05-29 11:56:51] [INFO ] Time to serialize properties into /tmp/LTL8483742104851060543.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/LTL8782728901541132143.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5238313202196691133.hoa' '-atoms' '/tmp/LTL8483742104851060543.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/LTL8483742104851060543.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5238313202196691133.hoa
Detected timeout of ITS tools.
[2024-05-29 11:57:06] [INFO ] Flatten gal took : 13 ms
[2024-05-29 11:57:06] [INFO ] Flatten gal took : 12 ms
[2024-05-29 11:57:06] [INFO ] Time to serialize gal into /tmp/LTL10490285553888434554.gal : 2 ms
[2024-05-29 11:57:06] [INFO ] Time to serialize properties into /tmp/LTL11584721754337997105.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10490285553888434554.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11584721754337997105.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 : !((X(G((F(G("(p75==1)")))U("(p0!=1)")))))
Formula 0 simplified : XF(GF!"(p75==1)" R !"(p0!=1)")
Detected timeout of ITS tools.
[2024-05-29 11:57:21] [INFO ] Flatten gal took : 17 ms
[2024-05-29 11:57:21] [INFO ] Applying decomposition
[2024-05-29 11:57:21] [INFO ] Flatten gal took : 12 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/graph1977196844894762457.txt' '-o' '/tmp/graph1977196844894762457.bin' '-w' '/tmp/graph1977196844894762457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1977196844894762457.bin' '-l' '-1' '-v' '-w' '/tmp/graph1977196844894762457.weights' '-q' '0' '-e' '0.001'
[2024-05-29 11:57:22] [INFO ] Decomposing Gal with order
[2024-05-29 11:57:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:57:22] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-29 11:57:22] [INFO ] Flatten gal took : 53 ms
[2024-05-29 11:57:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 11:57:22] [INFO ] Time to serialize gal into /tmp/LTL6275143907247515445.gal : 7 ms
[2024-05-29 11:57:22] [INFO ] Time to serialize properties into /tmp/LTL5282130390504551730.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/LTL6275143907247515445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5282130390504551730.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(i2.i2.u26.p75==1)")))U("(i1.i0.u0.p0!=1)")))))
Formula 0 simplified : XF(GF!"(i2.i2.u26.p75==1)" R !"(i1.i0.u0.p0!=1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7235505309610039072
[2024-05-29 11:57:37] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7235505309610039072
Running compilation step : cd /tmp/ltsmin7235505309610039072;'/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 425 ms.
Running link step : cd /tmp/ltsmin7235505309610039072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7235505309610039072;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>([]((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPt-PT-005B-LTLFireability-07 finished in 97174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X(p1)&&(G(p2)||(p2&&F(p3))))))'
Support contains 5 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 339 transition count 304
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 339 transition count 304
Applied a total of 18 rules in 11 ms. Remains 339 /348 variables (removed 9) and now considering 304/313 (removed 9) transitions.
// Phase 1: matrix 304 rows 339 cols
[2024-05-29 11:57:52] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 11:57:52] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 11:57:52] [INFO ] Invariant cache hit.
[2024-05-29 11:57:52] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-29 11:57:52] [INFO ] Invariant cache hit.
[2024-05-29 11:57:52] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 339/348 places, 304/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 553 ms. Remains : 339/348 places, 304/313 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=6 dest: 4}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p3), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(EQ s318 0), p2:(NEQ s134 1), p3:(NEQ s57 1), p1:(OR (EQ s11 0) (EQ s308 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Product exploration explored 100000 steps with 50000 reset in 256 ms.
Computed a total of 80 stabilizing places and 80 stable transitions
Computed a total of 80 stabilizing places and 80 stable transitions
Detected a total of 80/339 stabilizing places and 80/304 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 p2 p3 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p2) (NOT p3)))), true, (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 86 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-005B-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-005B-LTLFireability-08 finished in 1668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 340 transition count 305
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 340 transition count 305
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 339 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 338 transition count 303
Applied a total of 20 rules in 17 ms. Remains 338 /348 variables (removed 10) and now considering 303/313 (removed 10) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 11:57:54] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 11:57:54] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 11:57:54] [INFO ] Invariant cache hit.
[2024-05-29 11:57:54] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2024-05-29 11:57:54] [INFO ] Invariant cache hit.
[2024-05-29 11:57:54] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 338/348 places, 303/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 338/348 places, 303/313 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(EQ s259 0), p1:(NEQ s107 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 188 ms.
Product exploration explored 100000 steps with 33333 reset in 188 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPt-PT-005B-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-005B-LTLFireability-09 finished in 1190 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 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 347 transition count 236
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 271 transition count 236
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 152 place count 271 transition count 201
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 222 place count 236 transition count 201
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 228 place count 230 transition count 195
Iterating global reduction 2 with 6 rules applied. Total rules applied 234 place count 230 transition count 195
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 234 place count 230 transition count 191
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 242 place count 226 transition count 191
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 406 place count 144 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 407 place count 144 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 409 place count 143 transition count 107
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 437 place count 129 transition count 107
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 439 place count 127 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 440 place count 126 transition count 105
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 440 place count 126 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 444 place count 124 transition count 103
Applied a total of 444 rules in 37 ms. Remains 124 /348 variables (removed 224) and now considering 103/313 (removed 210) transitions.
// Phase 1: matrix 103 rows 124 cols
[2024-05-29 11:57:55] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 11:57:55] [INFO ] Implicit Places using invariants in 88 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 90 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/348 places, 103/313 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 101
Applied a total of 4 rules in 8 ms. Remains 120 /122 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 120 cols
[2024-05-29 11:57:55] [INFO ] Computed 53 invariants in 0 ms
[2024-05-29 11:57:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 11:57:55] [INFO ] Invariant cache hit.
[2024-05-29 11:57:55] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:57:55] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 120/348 places, 101/313 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 343 ms. Remains : 120/348 places, 101/313 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Product exploration explored 100000 steps with 0 reset in 321 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/120 stabilizing places and 2/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 1 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 120 /120 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-29 11:57:56] [INFO ] Invariant cache hit.
[2024-05-29 11:57:56] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 11:57:56] [INFO ] Invariant cache hit.
[2024-05-29 11:57:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 11:57:56] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-29 11:57:56] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 11:57:56] [INFO ] Invariant cache hit.
[2024-05-29 11:57:56] [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 330 ms. Remains : 120/120 places, 101/101 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/120 stabilizing places and 2/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(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 : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 206 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 350 ms.
Built C files in :
/tmp/ltsmin2306733848758231401
[2024-05-29 11:57:58] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-29 11:57:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:57:58] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-29 11:57:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:57:58] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-29 11:57:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:57:58] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2306733848758231401
Running compilation step : cd /tmp/ltsmin2306733848758231401;'/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/ltsmin2306733848758231401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2306733848758231401;'/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/stateBased1787302834277825340.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLFireability-10 finished in 3306 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((G(p0)||X(X(G(p1))))))))'
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 338 transition count 303
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 336 transition count 301
Applied a total of 24 rules in 19 ms. Remains 336 /348 variables (removed 12) and now considering 301/313 (removed 12) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 11:57:58] [INFO ] Computed 56 invariants in 5 ms
[2024-05-29 11:57:58] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 11:57:58] [INFO ] Invariant cache hit.
[2024-05-29 11:57:58] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-29 11:57:58] [INFO ] Invariant cache hit.
[2024-05-29 11:57:59] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/348 places, 301/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 541 ms. Remains : 336/348 places, 301/313 transitions.
Stuttering acceptance computed with spot in 363 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-11 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=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 7}]], initial=8, aps=[p1:(EQ s100 0), p0:(EQ s225 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 474 steps with 0 reset in 6 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-11 finished in 928 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(p1)||(p2 U p3)||p0)))'
Support contains 5 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 338 transition count 303
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 336 transition count 301
Applied a total of 24 rules in 23 ms. Remains 336 /348 variables (removed 12) and now considering 301/313 (removed 12) transitions.
[2024-05-29 11:57:59] [INFO ] Invariant cache hit.
[2024-05-29 11:57:59] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 11:57:59] [INFO ] Invariant cache hit.
[2024-05-29 11:57:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-05-29 11:57:59] [INFO ] Invariant cache hit.
[2024-05-29 11:58:00] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/348 places, 301/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 336/348 places, 301/313 transitions.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s278 1), p3:(EQ s137 1), p2:(AND (EQ s220 1) (EQ s245 1)), p0:(OR (EQ s278 1) (EQ s215 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 2199 reset in 180 ms.
Product exploration explored 100000 steps with 2197 reset in 180 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/336 stabilizing places and 78/301 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (AND (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
[2024-05-29 11:58:00] [INFO ] Invariant cache hit.
[2024-05-29 11:58:01] [INFO ] [Real]Absence check using 56 positive place invariants in 18 ms returned sat
[2024-05-29 11:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:01] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2024-05-29 11:58:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:58:01] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:58:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:01] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-05-29 11:58:01] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 5 ms to minimize.
[2024-05-29 11:58:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2024-05-29 11:58:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:58:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2024-05-29 11:58:02] [INFO ] Computed and/alt/rep : 300/446/300 causal constraints (skipped 0 transitions) in 26 ms.
[2024-05-29 11:58:03] [INFO ] Added : 294 causal constraints over 60 iterations in 1968 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 336 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 : 336/336 places, 301/301 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 335 transition count 232
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 137 place count 267 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 138 place count 266 transition count 231
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 138 place count 266 transition count 192
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 216 place count 227 transition count 192
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 374 place count 148 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 148 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 377 place count 147 transition count 111
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 403 place count 134 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 132 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 406 place count 131 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 406 place count 131 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 410 place count 129 transition count 107
Applied a total of 410 rules in 28 ms. Remains 129 /336 variables (removed 207) and now considering 107/301 (removed 194) transitions.
// Phase 1: matrix 107 rows 129 cols
[2024-05-29 11:58:03] [INFO ] Computed 55 invariants in 0 ms
[2024-05-29 11:58:04] [INFO ] Implicit Places using invariants in 84 ms returned [112, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 86 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/336 places, 107/301 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 4 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2024-05-29 11:58:04] [INFO ] Computed 53 invariants in 0 ms
[2024-05-29 11:58:04] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 11:58:04] [INFO ] Invariant cache hit.
[2024-05-29 11:58:04] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 125/336 places, 105/301 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 315 ms. Remains : 125/336 places, 105/301 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/125 stabilizing places and 2/105 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 250 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
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 p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2024-05-29 11:58:04] [INFO ] Invariant cache hit.
[2024-05-29 11:58:04] [INFO ] [Real]Absence check using 53 positive place invariants in 10 ms returned sat
[2024-05-29 11:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:04] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-29 11:58:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:58:05] [INFO ] [Nat]Absence check using 53 positive place invariants in 10 ms returned sat
[2024-05-29 11:58:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:05] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-29 11:58:05] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 11:58:05] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 11:58:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2024-05-29 11:58:05] [INFO ] Computed and/alt/rep : 103/172/103 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-29 11:58:05] [INFO ] Added : 90 causal constraints over 19 iterations in 210 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 40060 reset in 179 ms.
Product exploration explored 100000 steps with 40041 reset in 198 ms.
Built C files in :
/tmp/ltsmin13281587100385913955
[2024-05-29 11:58:05] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 11:58:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:58:05] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 11:58:05] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:58:05] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 11:58:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:58:05] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13281587100385913955
Running compilation step : cd /tmp/ltsmin13281587100385913955;'/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/ltsmin13281587100385913955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13281587100385913955;'/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/stateBased8240580183464408015.hoa' '--buchi-type=spotba'
LTSmin run took 107 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLFireability-12 finished in 6788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 348 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 338 transition count 303
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 337 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 336 transition count 301
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 336 transition count 301
Applied a total of 24 rules in 18 ms. Remains 336 /348 variables (removed 12) and now considering 301/313 (removed 12) transitions.
// Phase 1: matrix 301 rows 336 cols
[2024-05-29 11:58:06] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 11:58:06] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-29 11:58:06] [INFO ] Invariant cache hit.
[2024-05-29 11:58:06] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2024-05-29 11:58:06] [INFO ] Invariant cache hit.
[2024-05-29 11:58:06] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 336/348 places, 301/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 336/348 places, 301/313 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s246 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 1742 reset in 174 ms.
Product exploration explored 100000 steps with 1745 reset in 192 ms.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/336 stabilizing places and 78/301 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:58:07] [INFO ] Invariant cache hit.
[2024-05-29 11:58:07] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:58:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:08] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2024-05-29 11:58:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:58:08] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2024-05-29 11:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:08] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2024-05-29 11:58:08] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 11:58:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-05-29 11:58:08] [INFO ] Computed and/alt/rep : 300/446/300 causal constraints (skipped 0 transitions) in 20 ms.
[2024-05-29 11:58:10] [INFO ] Added : 297 causal constraints over 61 iterations in 1721 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 336/336 places, 301/301 transitions.
Applied a total of 0 rules in 6 ms. Remains 336 /336 variables (removed 0) and now considering 301/301 (removed 0) transitions.
[2024-05-29 11:58:10] [INFO ] Invariant cache hit.
[2024-05-29 11:58:10] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-29 11:58:10] [INFO ] Invariant cache hit.
[2024-05-29 11:58:10] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-29 11:58:10] [INFO ] Invariant cache hit.
[2024-05-29 11:58:10] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 336/336 places, 301/301 transitions.
Computed a total of 78 stabilizing places and 78 stable transitions
Computed a total of 78 stabilizing places and 78 stable transitions
Detected a total of 78/336 stabilizing places and 78/301 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 81 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 11:58:11] [INFO ] Invariant cache hit.
[2024-05-29 11:58:11] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:58:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:11] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2024-05-29 11:58:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 11:58:12] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2024-05-29 11:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:12] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-29 11:58:12] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 11:58:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-29 11:58:12] [INFO ] Computed and/alt/rep : 300/446/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-29 11:58:14] [INFO ] Added : 297 causal constraints over 61 iterations in 1690 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1746 reset in 184 ms.
Product exploration explored 100000 steps with 1759 reset in 187 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 336 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 336/336 places, 301/301 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 336 transition count 301
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 69 place count 336 transition count 321
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 94 place count 336 transition count 321
Performed 94 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 188 places in 0 ms
Iterating global reduction 1 with 94 rules applied. Total rules applied 188 place count 336 transition count 321
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 189 place count 336 transition count 320
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 225 place count 300 transition count 284
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 261 place count 300 transition count 284
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 153 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 262 place count 300 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 264 place count 298 transition count 282
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 266 place count 298 transition count 282
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 170 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 285 place count 298 transition count 362
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 304 place count 279 transition count 324
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 19 rules applied. Total rules applied 323 place count 279 transition count 324
Deduced a syphon composed of 151 places in 1 ms
Applied a total of 323 rules in 46 ms. Remains 279 /336 variables (removed 57) and now considering 324/301 (removed -23) transitions.
[2024-05-29 11:58:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 324 rows 279 cols
[2024-05-29 11:58:14] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 11:58:14] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/336 places, 324/301 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 279/336 places, 324/301 transitions.
Built C files in :
/tmp/ltsmin307541353710522218
[2024-05-29 11:58:14] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin307541353710522218
Running compilation step : cd /tmp/ltsmin307541353710522218;'/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 434 ms.
Running link step : cd /tmp/ltsmin307541353710522218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin307541353710522218;'/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/stateBased6290392845784966912.hoa' '--buchi-type=spotba'
LTSmin run took 655 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPt-PT-005B-LTLFireability-14 finished in 9912 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' '!(((p0 U p1)&&(p0 U (p2||G(p0)))))'
Support contains 3 out of 348 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 347 transition count 239
Reduce places removed 73 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 149 place count 274 transition count 236
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 152 place count 271 transition count 236
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 152 place count 271 transition count 203
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 218 place count 238 transition count 203
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 224 place count 232 transition count 197
Iterating global reduction 3 with 6 rules applied. Total rules applied 230 place count 232 transition count 197
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 230 place count 232 transition count 193
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 238 place count 228 transition count 193
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 3 with 160 rules applied. Total rules applied 398 place count 148 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 399 place count 148 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 401 place count 147 transition count 111
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 429 place count 133 transition count 111
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 430 place count 133 transition count 111
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 432 place count 131 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 433 place count 130 transition count 109
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 433 place count 130 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 437 place count 128 transition count 107
Applied a total of 437 rules in 25 ms. Remains 128 /348 variables (removed 220) and now considering 107/313 (removed 206) transitions.
// Phase 1: matrix 107 rows 128 cols
[2024-05-29 11:58:16] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 11:58:16] [INFO ] Implicit Places using invariants in 84 ms returned [111, 115]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 85 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/348 places, 107/313 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 105
Applied a total of 4 rules in 2 ms. Remains 124 /126 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 124 cols
[2024-05-29 11:58:16] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:58:16] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 11:58:16] [INFO ] Invariant cache hit.
[2024-05-29 11:58:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 11:58:16] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 124/348 places, 105/313 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 330 ms. Remains : 124/348 places, 105/313 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(NEQ s74 1), p2:(AND (NEQ s49 1) (NEQ s74 1)), p1:(OR (EQ s102 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1988 reset in 226 ms.
Stack based approach found an accepted trace after 77 steps with 1 reset with depth 22 and stack size 22 in 0 ms.
FORMULA ShieldPPPt-PT-005B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-005B-LTLFireability-15 finished in 709 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((F(G(p0)) U p1))))'
Found a Lengthening insensitive property : ShieldPPPt-PT-005B-LTLFireability-07
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 2 out of 348 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 348/348 places, 313/313 transitions.
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 348 transition count 236
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 271 transition count 236
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 154 place count 271 transition count 202
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 222 place count 237 transition count 202
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 227 place count 232 transition count 197
Iterating global reduction 2 with 5 rules applied. Total rules applied 232 place count 232 transition count 197
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 232 place count 232 transition count 194
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 238 place count 229 transition count 194
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 412 place count 142 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 413 place count 142 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 415 place count 141 transition count 105
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 443 place count 127 transition count 105
Applied a total of 443 rules in 20 ms. Remains 127 /348 variables (removed 221) and now considering 105/313 (removed 208) transitions.
// Phase 1: matrix 105 rows 127 cols
[2024-05-29 11:58:17] [INFO ] Computed 56 invariants in 0 ms
[2024-05-29 11:58:17] [INFO ] Implicit Places using invariants in 83 ms returned [120]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 126/348 places, 105/313 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 126 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 124 transition count 103
Applied a total of 4 rules in 2 ms. Remains 124 /126 variables (removed 2) and now considering 103/105 (removed 2) transitions.
// Phase 1: matrix 103 rows 124 cols
[2024-05-29 11:58:17] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 11:58:17] [INFO ] Implicit Places using invariants in 77 ms returned [107, 111]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 122/348 places, 103/313 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 120 transition count 101
Applied a total of 4 rules in 3 ms. Remains 120 /122 variables (removed 2) and now considering 101/103 (removed 2) transitions.
// Phase 1: matrix 101 rows 120 cols
[2024-05-29 11:58:17] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 11:58:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 11:58:17] [INFO ] Invariant cache hit.
[2024-05-29 11:58:17] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 11:58:17] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 120/348 places, 101/313 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 417 ms. Remains : 120/348 places, 101/313 transitions.
Running random walk in product with property : ShieldPPPt-PT-005B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s0 1), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 246 ms.
Product exploration explored 100000 steps with 0 reset in 289 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/120 stabilizing places and 1/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 110 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 144 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-29 11:58:18] [INFO ] Invariant cache hit.
[2024-05-29 11:58:18] [INFO ] [Real]Absence check using 53 positive place invariants in 8 ms returned sat
[2024-05-29 11:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:18] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-29 11:58:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 11:58:18] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-29 11:58:18] [INFO ] Computed and/alt/rep : 100/336/100 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 11:58:18] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 101/101 transitions.
Applied a total of 0 rules in 1 ms. Remains 120 /120 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-29 11:58:18] [INFO ] Invariant cache hit.
[2024-05-29 11:58:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 11:58:18] [INFO ] Invariant cache hit.
[2024-05-29 11:58:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 11:58:19] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2024-05-29 11:58:19] [INFO ] Invariant cache hit.
[2024-05-29 11:58:19] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 336 ms. Remains : 120/120 places, 101/101 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/120 stabilizing places and 1/101 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 104 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Finished random walk after 544 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=60 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X p1), true, (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
[2024-05-29 11:58:20] [INFO ] Invariant cache hit.
[2024-05-29 11:58:20] [INFO ] [Real]Absence check using 53 positive place invariants in 8 ms returned sat
[2024-05-29 11:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 11:58:20] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-29 11:58:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 11:58:20] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-29 11:58:20] [INFO ] Computed and/alt/rep : 100/336/100 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 11:58:20] [INFO ] Added : 0 causal constraints over 0 iterations in 17 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 241 ms.
Product exploration explored 100000 steps with 0 reset in 381 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 120/120 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 120 /120 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-29 11:58:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 11:58:21] [INFO ] Invariant cache hit.
[2024-05-29 11:58:21] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 120/120 places, 101/101 transitions.
Built C files in :
/tmp/ltsmin9529260981851974259
[2024-05-29 11:58:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9529260981851974259
Running compilation step : cd /tmp/ltsmin9529260981851974259;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 191 ms.
Running link step : cd /tmp/ltsmin9529260981851974259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9529260981851974259;'/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/stateBased216730530577947451.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 120 /120 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-29 11:58:36] [INFO ] Invariant cache hit.
[2024-05-29 11:58:36] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-29 11:58:36] [INFO ] Invariant cache hit.
[2024-05-29 11:58:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 11:58:36] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-29 11:58:36] [INFO ] Invariant cache hit.
[2024-05-29 11:58:36] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 120/120 places, 101/101 transitions.
Built C files in :
/tmp/ltsmin13983212412095301687
[2024-05-29 11:58:36] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13983212412095301687
Running compilation step : cd /tmp/ltsmin13983212412095301687;'/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 197 ms.
Running link step : cd /tmp/ltsmin13983212412095301687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin13983212412095301687;'/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/stateBased9843251281091657419.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 11:58:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 11:58:51] [INFO ] Flatten gal took : 4 ms
[2024-05-29 11:58:51] [INFO ] Time to serialize gal into /tmp/LTL7040270931172225653.gal : 2 ms
[2024-05-29 11:58:51] [INFO ] Time to serialize properties into /tmp/LTL11386091517214203964.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/LTL7040270931172225653.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15406085369317649724.hoa' '-atoms' '/tmp/LTL11386091517214203964.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11386091517214203964.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15406085369317649724.hoa
Reverse transition relation is NOT exact ! Due to transitions t217.t212.t213.t214, t217.t212.t215, Intersection with reachable at each step enabled. (dest...197
Computing Next relation with stutter on 1.74523e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
57 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.585313,32148,1,0,180,86340,226,75,3939,103886,222
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property ShieldPPPt-PT-005B-LTLFireability-07 finished in 35795 ms.
Length sensitive decision was in the wrong direction : Lengthening insensitive + true
[2024-05-29 11:58:52] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9755605184981910651
[2024-05-29 11:58:52] [INFO ] Computing symmetric may disable matrix : 313 transitions.
[2024-05-29 11:58:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:58:52] [INFO ] Computing symmetric may enable matrix : 313 transitions.
[2024-05-29 11:58:52] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:58:52] [INFO ] Applying decomposition
[2024-05-29 11:58:52] [INFO ] Flatten gal took : 9 ms
[2024-05-29 11:58:52] [INFO ] Computing Do-Not-Accords matrix : 313 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6042941612638667934.txt' '-o' '/tmp/graph6042941612638667934.bin' '-w' '/tmp/graph6042941612638667934.weights'
[2024-05-29 11:58:52] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 11:58:52] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9755605184981910651
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6042941612638667934.bin' '-l' '-1' '-v' '-w' '/tmp/graph6042941612638667934.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin9755605184981910651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 11:58:52] [INFO ] Decomposing Gal with order
[2024-05-29 11:58:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 11:58:52] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-29 11:58:52] [INFO ] Flatten gal took : 20 ms
[2024-05-29 11:58:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 11:58:52] [INFO ] Time to serialize gal into /tmp/LTLFireability15560939841296696114.gal : 6 ms
[2024-05-29 11:58:52] [INFO ] Time to serialize properties into /tmp/LTLFireability18401737705616680633.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/LTLFireability15560939841296696114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18401737705616680633.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(i5.i1.u25.p75==1)")))U("(i1.i0.u0.p0!=1)")))))
Formula 0 simplified : XF(GF!"(i5.i1.u25.p75==1)" R !"(i1.i0.u0.p0!=1)")
Compilation finished in 578 ms.
Running link step : cd /tmp/ltsmin9755605184981910651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9755605184981910651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>([]((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t52, t55, t99, t102, t153, t197, t200, t245, t248, t278, t283, t287, t295, t301, t304, t305, ...1325
Computing Next relation with stutter on 1.74523e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: LTL layer: formula: X([]((<>([]((LTLAPp0==true))) U (LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.007: "X([]((<>([]((LTLAPp0==true))) U (LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.007: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.017: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.026: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.081: There are 316 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.081: State length is 349, there are 323 groups
pins2lts-mc-linux64( 0/ 8), 0.081: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.081: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.081: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.081: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 0.138: [Blue] ~120 levels ~960 states ~6632 transitions
pins2lts-mc-linux64( 6/ 8), 0.167: [Blue] ~234 levels ~1920 states ~10528 transitions
pins2lts-mc-linux64( 6/ 8), 0.215: [Blue] ~472 levels ~3840 states ~19784 transitions
pins2lts-mc-linux64( 6/ 8), 0.309: [Blue] ~938 levels ~7680 states ~39296 transitions
pins2lts-mc-linux64( 6/ 8), 0.518: [Blue] ~1894 levels ~15360 states ~78496 transitions
pins2lts-mc-linux64( 6/ 8), 0.760: [Blue] ~3785 levels ~30720 states ~153792 transitions
pins2lts-mc-linux64( 6/ 8), 1.289: [Blue] ~7587 levels ~61440 states ~306184 transitions
pins2lts-mc-linux64( 6/ 8), 2.190: [Blue] ~15216 levels ~122880 states ~628136 transitions
pins2lts-mc-linux64( 6/ 8), 3.356: [Blue] ~30455 levels ~245760 states ~1270184 transitions
pins2lts-mc-linux64( 6/ 8), 5.270: [Blue] ~60769 levels ~491520 states ~2621200 transitions
pins2lts-mc-linux64( 6/ 8), 8.795: [Blue] ~121584 levels ~983040 states ~5451456 transitions
pins2lts-mc-linux64( 6/ 8), 16.153: [Blue] ~243086 levels ~1966080 states ~11189360 transitions
pins2lts-mc-linux64( 6/ 8), 31.422: [Blue] ~486258 levels ~3932160 states ~22910952 transitions
pins2lts-mc-linux64( 6/ 8), 61.967: [Blue] ~972650 levels ~7864320 states ~47191296 transitions
pins2lts-mc-linux64( 6/ 8), 123.623: [Blue] ~1945558 levels ~15728640 states ~96952448 transitions
pins2lts-mc-linux64( 4/ 8), 233.171: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 233.246:
pins2lts-mc-linux64( 0/ 8), 233.246: Explored 28202281 states 189962745 transitions, fanout: 6.736
pins2lts-mc-linux64( 0/ 8), 233.246: Total exploration time 233.160 sec (233.090 sec minimum, 233.126 sec on average)
pins2lts-mc-linux64( 0/ 8), 233.246: States per second: 120957, Transitions per second: 814731
pins2lts-mc-linux64( 0/ 8), 233.246:
pins2lts-mc-linux64( 0/ 8), 233.246: State space has 92270116 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 233.246: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 233.246: blue states: 28202281 (30.56%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 233.246: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 233.246: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 233.246:
pins2lts-mc-linux64( 0/ 8), 233.246: Total memory used for local state coloring: 326.6MB
pins2lts-mc-linux64( 0/ 8), 233.246:
pins2lts-mc-linux64( 0/ 8), 233.246: Queue width: 8B, total height: 21402368, memory: 163.29MB
pins2lts-mc-linux64( 0/ 8), 233.246: Tree memory: 960.0MB, 10.9 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 233.246: Tree fill ratio (roots/leafs): 68.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 233.246: Stored 319 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 233.246: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 233.246: Est. total memory use: 1123.3MB (~1187.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9755605184981910651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>([]((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9755605184981910651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([]((<>([]((LTLAPp0==true))) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-29 12:19:47] [INFO ] Applying decomposition
[2024-05-29 12:19:47] [INFO ] Flatten gal took : 10 ms
[2024-05-29 12:19:47] [INFO ] Decomposing Gal with order
[2024-05-29 12:19:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 12:19:47] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-29 12:19:47] [INFO ] Flatten gal took : 17 ms
[2024-05-29 12:19:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 9 ms.
[2024-05-29 12:19:47] [INFO ] Time to serialize gal into /tmp/LTLFireability7669467232490614761.gal : 4 ms
[2024-05-29 12:19:47] [INFO ] Time to serialize properties into /tmp/LTLFireability8370163387927081471.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/LTLFireability7669467232490614761.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8370163387927081471.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(G((F(G("(i0.i0.i0.i0.i1.u26.p75==1)")))U("(u134.p0!=1)")))))
Formula 0 simplified : XF(GF!"(i0.i0.i0.i0.i1.u26.p75==1)" R !"(u134.p0!=1)")
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.i0.u5.t255, i0.i0.i0.i0.i1.u26.t210, i0.i0.i0.i0.i1.u26.t211, i0.i0.i0.i0.i1.u26.t21...2750
Detected timeout of ITS tools.
[2024-05-29 12:40:50] [INFO ] Flatten gal took : 426 ms
[2024-05-29 12:40:51] [INFO ] Input system was already deterministic with 313 transitions.
[2024-05-29 12:40:51] [INFO ] Transformed 348 places.
[2024-05-29 12:40:51] [INFO ] Transformed 313 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 12:40:51] [INFO ] Time to serialize gal into /tmp/LTLFireability13386614005082287495.gal : 8 ms
[2024-05-29 12:40:51] [INFO ] Time to serialize properties into /tmp/LTLFireability9680092958890917309.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/LTLFireability13386614005082287495.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9680092958890917309.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G((F(G("(p75==1)")))U("(p0!=1)")))))
Formula 0 simplified : XF(GF!"(p75==1)" R !"(p0!=1)")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4897200 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16120788 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="ShieldPPPt-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 ShieldPPPt-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-171683789100378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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