About the Execution of 2023-gold for ShieldPPPs-PT-003B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16217.483 | 3600000.00 | 5462939.00 | 208079.60 | F?FFFFFFFFFFFFF? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788900248.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788900248
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 13 11:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 13 11:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 11:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 11:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 52K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-003B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716961104178
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=ShieldPPPs-PT-003B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 05:38:26] [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 05:38:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 05:38:26] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-29 05:38:26] [INFO ] Transformed 207 places.
[2024-05-29 05:38:26] [INFO ] Transformed 192 transitions.
[2024-05-29 05:38:26] [INFO ] Found NUPN structural information;
[2024-05-29 05:38:26] [INFO ] Parsed PT model containing 207 places and 192 transitions and 528 arcs in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldPPPs-PT-003B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 207 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 207/207 places, 192/192 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 188 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 188 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 187 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 187 transition count 172
Applied a total of 40 rules in 39 ms. Remains 187 /207 variables (removed 20) and now considering 172/192 (removed 20) transitions.
// Phase 1: matrix 172 rows 187 cols
[2024-05-29 05:38:26] [INFO ] Computed 34 invariants in 20 ms
[2024-05-29 05:38:26] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-29 05:38:26] [INFO ] Invariant cache hit.
[2024-05-29 05:38:26] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-29 05:38:26] [INFO ] Invariant cache hit.
[2024-05-29 05:38:27] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 187/207 places, 172/192 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 592 ms. Remains : 187/207 places, 172/192 transitions.
Support contains 26 out of 187 places after structural reductions.
[2024-05-29 05:38:27] [INFO ] Flatten gal took : 35 ms
[2024-05-29 05:38:27] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:38:27] [INFO ] Input system was already deterministic with 172 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Finished Best-First random walk after 755 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=377 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 35 stabilizing places and 35 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||G(p1)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 164 transition count 134
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 149 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 147 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 147 transition count 132
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 96 transition count 81
Applied a total of 178 rules in 58 ms. Remains 96 /187 variables (removed 91) and now considering 81/172 (removed 91) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 05:38:27] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:38:28] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-29 05:38:28] [INFO ] Invariant cache hit.
[2024-05-29 05:38:28] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-29 05:38:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:38:28] [INFO ] Invariant cache hit.
[2024-05-29 05:38:28] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/187 places, 81/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 96/187 places, 81/172 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 202 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s25 1)), p0:(AND (EQ s52 1) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1847 reset in 357 ms.
Product exploration explored 100000 steps with 1830 reset in 299 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 55 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=27 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 05:38:29] [INFO ] Invariant cache hit.
[2024-05-29 05:38:29] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-29 05:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:38:29] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-29 05:38:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:38:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-29 05:38:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:38:29] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-29 05:38:29] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:38:30] [INFO ] Added : 70 causal constraints over 14 iterations in 197 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 05:38:30] [INFO ] Invariant cache hit.
[2024-05-29 05:38:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-29 05:38:30] [INFO ] Invariant cache hit.
[2024-05-29 05:38:30] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-29 05:38:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:38:30] [INFO ] Invariant cache hit.
[2024-05-29 05:38:30] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 663 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 50 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 118 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 05:38:31] [INFO ] Invariant cache hit.
[2024-05-29 05:38:31] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 05:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:38:31] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-29 05:38:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:38:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2024-05-29 05:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:38:31] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-29 05:38:31] [INFO ] Computed and/alt/rep : 77/151/77 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 05:38:31] [INFO ] Added : 70 causal constraints over 14 iterations in 144 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1855 reset in 221 ms.
Product exploration explored 100000 steps with 1873 reset in 251 ms.
Built C files in :
/tmp/ltsmin8500618804518438367
[2024-05-29 05:38:32] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 05:38:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:32] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 05:38:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:32] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 05:38:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8500618804518438367
Running compilation step : cd /tmp/ltsmin8500618804518438367;'/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 311 ms.
Running link step : cd /tmp/ltsmin8500618804518438367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8500618804518438367;'/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/stateBased2115597504504860268.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 05:38:47] [INFO ] Invariant cache hit.
[2024-05-29 05:38:47] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-29 05:38:47] [INFO ] Invariant cache hit.
[2024-05-29 05:38:47] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 05:38:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:38:47] [INFO ] Invariant cache hit.
[2024-05-29 05:38:47] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 96/96 places, 81/81 transitions.
Built C files in :
/tmp/ltsmin11831701495297130743
[2024-05-29 05:38:47] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 05:38:47] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:47] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 05:38:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:47] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 05:38:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:38:47] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11831701495297130743
Running compilation step : cd /tmp/ltsmin11831701495297130743;'/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 178 ms.
Running link step : cd /tmp/ltsmin11831701495297130743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11831701495297130743;'/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/stateBased7326830051223060753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:39:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:39:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:39:02] [INFO ] Time to serialize gal into /tmp/LTL17212562148878724269.gal : 2 ms
[2024-05-29 05:39:02] [INFO ] Time to serialize properties into /tmp/LTL13423676442357083666.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17212562148878724269.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10172142960973974969.hoa' '-atoms' '/tmp/LTL13423676442357083666.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13423676442357083666.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10172142960973974969.hoa
Detected timeout of ITS tools.
[2024-05-29 05:39:17] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:39:17] [INFO ] Flatten gal took : 5 ms
[2024-05-29 05:39:17] [INFO ] Time to serialize gal into /tmp/LTL17020743037161807926.gal : 2 ms
[2024-05-29 05:39:17] [INFO ] Time to serialize properties into /tmp/LTL3337117134163480969.ltl : 4 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/LTL17020743037161807926.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3337117134163480969.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((p16==1)&&(p51==1))"))||("((p107==1)&&(p158==1))")))))
Formula 0 simplified : G(F!"((p16==1)&&(p51==1))" & FG!"((p107==1)&&(p158==1))")
Detected timeout of ITS tools.
[2024-05-29 05:39:32] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:39:32] [INFO ] Applying decomposition
[2024-05-29 05:39:32] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10102199628526954530.txt' '-o' '/tmp/graph10102199628526954530.bin' '-w' '/tmp/graph10102199628526954530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10102199628526954530.bin' '-l' '-1' '-v' '-w' '/tmp/graph10102199628526954530.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:39:32] [INFO ] Decomposing Gal with order
[2024-05-29 05:39:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:39:33] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 05:39:33] [INFO ] Flatten gal took : 35 ms
[2024-05-29 05:39:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2024-05-29 05:39:33] [INFO ] Time to serialize gal into /tmp/LTL18360442841626961556.gal : 2 ms
[2024-05-29 05:39:33] [INFO ] Time to serialize properties into /tmp/LTL11135962655038757764.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/LTL18360442841626961556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11135962655038757764.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i3.u1.p16==1)&&(i3.u9.p51==1))"))||("((i4.u19.p107==1)&&(i8.i0.u26.p158==1))")))))
Formula 0 simplified : G(F!"((i3.u1.p16==1)&&(i3.u9.p51==1))" & FG!"((i4.u19.p107==1)&&(i8.i0.u26.p158==1))")
Reverse transition relation is NOT exact ! Due to transitions t0_t117, t1_t114, t2_t111, t12_t90, t13_t87, t14_t84, t25_t63, t26_t60, t27_t57_t120_t56, i0....746
Computing Next relation with stutter on 7758 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1569065888129909797
[2024-05-29 05:39:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1569065888129909797
Running compilation step : cd /tmp/ltsmin1569065888129909797;'/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 160 ms.
Running link step : cd /tmp/ltsmin1569065888129909797;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin1569065888129909797;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-01 finished in 95326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 164 transition count 133
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 180 place count 96 transition count 81
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 182 place count 94 transition count 79
Applied a total of 182 rules in 28 ms. Remains 94 /187 variables (removed 93) and now considering 79/172 (removed 93) transitions.
// Phase 1: matrix 79 rows 94 cols
[2024-05-29 05:40:03] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:03] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 05:40:03] [INFO ] Invariant cache hit.
[2024-05-29 05:40:03] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-29 05:40:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:03] [INFO ] Invariant cache hit.
[2024-05-29 05:40:03] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/187 places, 79/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 94/187 places, 79/172 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-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:(AND (EQ s5 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-02 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1 U p2))))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 187 transition count 151
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 166 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 165 transition count 150
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 44 place count 165 transition count 135
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 74 place count 150 transition count 135
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 148 transition count 133
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 148 transition count 133
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 176 place count 99 transition count 84
Applied a total of 176 rules in 23 ms. Remains 99 /187 variables (removed 88) and now considering 84/172 (removed 88) transitions.
// Phase 1: matrix 84 rows 99 cols
[2024-05-29 05:40:03] [INFO ] Computed 34 invariants in 3 ms
[2024-05-29 05:40:03] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 05:40:03] [INFO ] Invariant cache hit.
[2024-05-29 05:40:03] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 05:40:03] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:03] [INFO ] Invariant cache hit.
[2024-05-29 05:40:03] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/187 places, 84/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 99/187 places, 84/172 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s21 1) (EQ s33 1)), p2:(EQ s4 1), p1:(EQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 261 steps with 2 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-03 finished in 497 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 18 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 05:40:04] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:04] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 05:40:04] [INFO ] Invariant cache hit.
[2024-05-29 05:40:04] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-29 05:40:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:04] [INFO ] Invariant cache hit.
[2024-05-29 05:40:04] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 227 ms. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-05 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 s65 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]]
Stuttering criterion allowed to conclude after 228 steps with 2 reset in 2 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-05 finished in 311 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)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 186 transition count 171
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 186 transition count 171
Applied a total of 2 rules in 8 ms. Remains 186 /187 variables (removed 1) and now considering 171/172 (removed 1) transitions.
// Phase 1: matrix 171 rows 186 cols
[2024-05-29 05:40:04] [INFO ] Computed 34 invariants in 5 ms
[2024-05-29 05:40:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 05:40:04] [INFO ] Invariant cache hit.
[2024-05-29 05:40:04] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-29 05:40:04] [INFO ] Invariant cache hit.
[2024-05-29 05:40:04] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 186/187 places, 171/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 319 ms. Remains : 186/187 places, 171/172 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s101 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][false, false]]
Stuttering criterion allowed to conclude after 484 steps with 0 reset in 4 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-06 finished in 413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X((X(p1) U p2))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 7 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 05:40:04] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:04] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 05:40:04] [INFO ] Invariant cache hit.
[2024-05-29 05:40:04] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-29 05:40:04] [INFO ] Invariant cache hit.
[2024-05-29 05:40:05] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 342 ms :[(NOT p0), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p2) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p0 p2 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 4}]], initial=6, aps=[p0:(EQ s129 1), p2:(EQ s79 1), p1:(EQ s68 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-07 finished in 689 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)||(p1&&G(p2)))))'
Support contains 4 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 44 place count 164 transition count 134
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 74 place count 149 transition count 134
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 147 transition count 132
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 147 transition count 132
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 176 place count 98 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 96 transition count 81
Applied a total of 178 rules in 26 ms. Remains 96 /187 variables (removed 91) and now considering 81/172 (removed 91) transitions.
// Phase 1: matrix 81 rows 96 cols
[2024-05-29 05:40:05] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:40:05] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-29 05:40:05] [INFO ] Invariant cache hit.
[2024-05-29 05:40:05] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-29 05:40:05] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:05] [INFO ] Invariant cache hit.
[2024-05-29 05:40:05] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/187 places, 81/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 223 ms. Remains : 96/187 places, 81/172 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={1} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s32 0) (EQ s76 0) (EQ s95 0)), p1:(OR (EQ s16 0) (EQ s32 0)), p2:(OR (EQ s76 0) (EQ s95 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 410 reset in 299 ms.
Product exploration explored 100000 steps with 417 reset in 324 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 174 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 05:40:06] [INFO ] Invariant cache hit.
[2024-05-29 05:40:06] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p0) p2 p1))), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(F (AND p0 (NOT p2))), (F (NOT (AND p0 p2))), (F (AND (NOT p0) (NOT p2))), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (F (NOT (AND p0 p2 p1))), (F (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 19 factoid took 575 ms. Reduced automaton from 2 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 4 out of 96 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 96/96 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 96 /96 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 05:40:07] [INFO ] Invariant cache hit.
[2024-05-29 05:40:07] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 05:40:07] [INFO ] Invariant cache hit.
[2024-05-29 05:40:07] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-29 05:40:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:07] [INFO ] Invariant cache hit.
[2024-05-29 05:40:07] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 222 ms. Remains : 96/96 places, 81/81 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 36 ms :[(NOT p0)]
Finished random walk after 1260 steps, including 5 resets, run visited all 1 properties in 12 ms. (steps per millisecond=105 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 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 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 415 reset in 220 ms.
Product exploration explored 100000 steps with 416 reset in 242 ms.
Built C files in :
/tmp/ltsmin6356588586539523027
[2024-05-29 05:40:08] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-29 05:40:08] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:40:08] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-29 05:40:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:40:08] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-29 05:40:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:40:08] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6356588586539523027
Running compilation step : cd /tmp/ltsmin6356588586539523027;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 183 ms.
Running link step : cd /tmp/ltsmin6356588586539523027;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin6356588586539523027;'/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/stateBased15850361620398845210.hoa' '--buchi-type=spotba'
LTSmin run took 6133 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-003B-LTLFireability-09 finished in 9644 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(F(p1)))))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
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 76 place count 148 transition count 133
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 16 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 05:40:15] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:40:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 05:40:15] [INFO ] Invariant cache hit.
[2024-05-29 05:40:15] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-29 05:40:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:15] [INFO ] Invariant cache hit.
[2024-05-29 05:40:15] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 232 ms. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s89 1), p1:(AND (EQ s52 0) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 902 steps with 6 reset in 4 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-11 finished in 322 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 X(G(!p0))) U G(!p0)))'
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 186 transition count 149
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 44 place count 164 transition count 149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 44 place count 164 transition count 133
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 30 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 05:40:15] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 05:40:15] [INFO ] Invariant cache hit.
[2024-05-29 05:40:15] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-05-29 05:40:15] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 05:40:15] [INFO ] Invariant cache hit.
[2024-05-29 05:40:15] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 95/187 places, 80/172 transitions.
Stuttering acceptance computed with spot in 211 ms :[p0, true, p0]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=2, aps=[p0:(NEQ s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-12 finished in 490 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(G((p1&&F(p2))))))'
Support contains 3 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 7 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 05:40:15] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:15] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 05:40:15] [INFO ] Invariant cache hit.
[2024-05-29 05:40:16] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-29 05:40:16] [INFO ] Invariant cache hit.
[2024-05-29 05:40:16] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s44 1)), p1:(EQ s135 1), p2:(EQ s135 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-13 finished in 562 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 7 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
[2024-05-29 05:40:16] [INFO ] Invariant cache hit.
[2024-05-29 05:40:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 05:40:16] [INFO ] Invariant cache hit.
[2024-05-29 05:40:16] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-29 05:40:16] [INFO ] Invariant cache hit.
[2024-05-29 05:40:16] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-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:(AND (EQ s172 1) (EQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 560 steps with 0 reset in 3 ms.
FORMULA ShieldPPPs-PT-003B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-003B-LTLFireability-14 finished in 450 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 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 170
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 170
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 170/172 (removed 2) transitions.
[2024-05-29 05:40:16] [INFO ] Invariant cache hit.
[2024-05-29 05:40:16] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 05:40:16] [INFO ] Invariant cache hit.
[2024-05-29 05:40:17] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-29 05:40:17] [INFO ] Invariant cache hit.
[2024-05-29 05:40:17] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 185/187 places, 170/172 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 185/187 places, 170/172 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15 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 s130 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 5111 reset in 128 ms.
Product exploration explored 100000 steps with 5116 reset in 136 ms.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 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 102 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 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
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 102 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 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 05:40:18] [INFO ] Invariant cache hit.
[2024-05-29 05:40:18] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-29 05:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:40:18] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-29 05:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:40:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-29 05:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:40:18] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-05-29 05:40:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 4 ms to minimize.
[2024-05-29 05:40:18] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:40:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2024-05-29 05:40:18] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-29 05:40:19] [INFO ] Added : 145 causal constraints over 31 iterations in 799 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-29 05:40:19] [INFO ] Invariant cache hit.
[2024-05-29 05:40:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-29 05:40:19] [INFO ] Invariant cache hit.
[2024-05-29 05:40:19] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-29 05:40:19] [INFO ] Invariant cache hit.
[2024-05-29 05:40:19] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 185/185 places, 170/170 transitions.
Computed a total of 35 stabilizing places and 35 stable transitions
Computed a total of 35 stabilizing places and 35 stable transitions
Detected a total of 35/185 stabilizing places and 35/170 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 70 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 97 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 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 118 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-29 05:40:20] [INFO ] Invariant cache hit.
[2024-05-29 05:40:20] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2024-05-29 05:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 05:40:20] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-29 05:40:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 05:40:20] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-29 05:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 05:40:20] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-05-29 05:40:20] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 05:40:20] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 05:40:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-29 05:40:20] [INFO ] Computed and/alt/rep : 169/299/169 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-29 05:40:21] [INFO ] Added : 145 causal constraints over 31 iterations in 813 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5081 reset in 127 ms.
Product exploration explored 100000 steps with 5115 reset in 134 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 185 transition count 170
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 22 place count 185 transition count 171
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 29 place count 185 transition count 171
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 89 place count 185 transition count 171
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 112 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 135 place count 162 transition count 148
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 135 rules in 43 ms. Remains 162 /185 variables (removed 23) and now considering 148/170 (removed 22) transitions.
[2024-05-29 05:40:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 148 rows 162 cols
[2024-05-29 05:40:22] [INFO ] Computed 34 invariants in 1 ms
[2024-05-29 05:40:22] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 162/185 places, 148/170 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 146 ms. Remains : 162/185 places, 148/170 transitions.
Built C files in :
/tmp/ltsmin5088910964733940322
[2024-05-29 05:40:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5088910964733940322
Running compilation step : cd /tmp/ltsmin5088910964733940322;'/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 257 ms.
Running link step : cd /tmp/ltsmin5088910964733940322;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5088910964733940322;'/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/stateBased6423855688250176246.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 170/170 transitions.
Applied a total of 0 rules in 8 ms. Remains 185 /185 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 185 cols
[2024-05-29 05:40:37] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:40:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-29 05:40:37] [INFO ] Invariant cache hit.
[2024-05-29 05:40:37] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-29 05:40:37] [INFO ] Invariant cache hit.
[2024-05-29 05:40:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 185/185 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin11895197541350638745
[2024-05-29 05:40:37] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11895197541350638745
Running compilation step : cd /tmp/ltsmin11895197541350638745;'/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 262 ms.
Running link step : cd /tmp/ltsmin11895197541350638745;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin11895197541350638745;'/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/stateBased9179482807160466673.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 05:40:52] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:40:53] [INFO ] Flatten gal took : 9 ms
[2024-05-29 05:40:53] [INFO ] Time to serialize gal into /tmp/LTL18260637014015568504.gal : 2 ms
[2024-05-29 05:40:53] [INFO ] Time to serialize properties into /tmp/LTL9381284706637448597.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/LTL18260637014015568504.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1903737043480237260.hoa' '-atoms' '/tmp/LTL9381284706637448597.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9381284706637448597.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1903737043480237260.hoa
Detected timeout of ITS tools.
[2024-05-29 05:41:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 05:41:08] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:41:08] [INFO ] Time to serialize gal into /tmp/LTL12894382680258529162.gal : 2 ms
[2024-05-29 05:41:08] [INFO ] Time to serialize properties into /tmp/LTL2973825739622289950.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/LTL12894382680258529162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2973825739622289950.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p144==1)")))))
Formula 0 simplified : XXG!"(p144==1)"
Detected timeout of ITS tools.
[2024-05-29 05:41:23] [INFO ] Flatten gal took : 7 ms
[2024-05-29 05:41:23] [INFO ] Applying decomposition
[2024-05-29 05:41:23] [INFO ] Flatten gal took : 14 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/graph11363688429292833165.txt' '-o' '/tmp/graph11363688429292833165.bin' '-w' '/tmp/graph11363688429292833165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11363688429292833165.bin' '-l' '-1' '-v' '-w' '/tmp/graph11363688429292833165.weights' '-q' '0' '-e' '0.001'
[2024-05-29 05:41:23] [INFO ] Decomposing Gal with order
[2024-05-29 05:41:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:41:23] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 05:41:23] [INFO ] Flatten gal took : 15 ms
[2024-05-29 05:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 05:41:23] [INFO ] Time to serialize gal into /tmp/LTL11214441002660234119.gal : 4 ms
[2024-05-29 05:41:23] [INFO ] Time to serialize properties into /tmp/LTL4567141141568530766.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/LTL11214441002660234119.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4567141141568530766.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i9.i0.u50.p144==1)")))))
Formula 0 simplified : XXG!"(i9.i0.u50.p144==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3047518362741158761
[2024-05-29 05:41:38] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3047518362741158761
Running compilation step : cd /tmp/ltsmin3047518362741158761;'/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 261 ms.
Running link step : cd /tmp/ltsmin3047518362741158761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin3047518362741158761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 96427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
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))))'
Found a Shortening insensitive property : ShieldPPPs-PT-003B-LTLFireability-15
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 187 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 187/187 places, 172/172 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 186 transition count 148
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 163 transition count 148
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 46 place count 163 transition count 133
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 76 place count 148 transition count 133
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 146 transition count 131
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 146 transition count 131
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 2 with 98 rules applied. Total rules applied 178 place count 97 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 95 transition count 80
Applied a total of 180 rules in 19 ms. Remains 95 /187 variables (removed 92) and now considering 80/172 (removed 92) transitions.
// Phase 1: matrix 80 rows 95 cols
[2024-05-29 05:41:53] [INFO ] Computed 34 invariants in 2 ms
[2024-05-29 05:41:53] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 05:41:53] [INFO ] Invariant cache hit.
[2024-05-29 05:41:53] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-29 05:41:53] [INFO ] Invariant cache hit.
[2024-05-29 05:41:53] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 95/187 places, 80/172 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 227 ms. Remains : 95/187 places, 80/172 transitions.
Running random walk in product with property : ShieldPPPs-PT-003B-LTLFireability-15 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 s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 252 steps with 0 reset in 0 ms.
Treatment of property ShieldPPPs-PT-003B-LTLFireability-15 finished in 450 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-29 05:41:53] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8155150139382407252
[2024-05-29 05:41:53] [INFO ] Computing symmetric may disable matrix : 172 transitions.
[2024-05-29 05:41:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:41:53] [INFO ] Computing symmetric may enable matrix : 172 transitions.
[2024-05-29 05:41:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 05:41:53] [INFO ] Applying decomposition
[2024-05-29 05:41:53] [INFO ] Flatten gal took : 6 ms
[2024-05-29 05:41:53] [INFO ] Computing Do-Not-Accords matrix : 172 transitions.
[2024-05-29 05:41:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
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/graph16952584893577220773.txt' '-o' '/tmp/graph16952584893577220773.bin' '-w' '/tmp/graph16952584893577220773.weights'
[2024-05-29 05:41:53] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8155150139382407252
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph16952584893577220773.bin' '-l' '-1' '-v' '-w' '/tmp/graph16952584893577220773.weights' '-q' '0' '-e' '0.001'
Running compilation step : cd /tmp/ltsmin8155150139382407252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-29 05:41:53] [INFO ] Decomposing Gal with order
[2024-05-29 05:41:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 05:41:53] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-29 05:41:53] [INFO ] Flatten gal took : 32 ms
[2024-05-29 05:41:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 05:41:53] [INFO ] Time to serialize gal into /tmp/LTLFireability15425275708713126846.gal : 12 ms
[2024-05-29 05:41:53] [INFO ] Time to serialize properties into /tmp/LTLFireability17600722792186558651.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/LTLFireability15425275708713126846.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17600722792186558651.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 2 LTL properties
Checking formula 0 : !((G(F(("((i5.i2.u39.p107==1)&&(i9.i0.u56.p158==1))")||(G("((i1.i1.u5.p16==1)&&(i1.i0.u18.p51==1))"))))))
Formula 0 simplified : G(F!"((i1.i1.u5.p16==1)&&(i1.i0.u18.p51==1))" & FG!"((i5.i2.u39.p107==1)&&(i9.i0.u56.p158==1))")
Compilation finished in 348 ms.
Running link step : cd /tmp/ltsmin8155150139382407252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8155150139382407252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t55, t58, t82, t85, t109, t112, t115, i0.u1.t119, i1.i1.u5.t118, i2.i0.u12.t111, i2.i1.u22.t9...957
Computing Next relation with stutter on 7758 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.158: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.164: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.177: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.178: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.188: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.191: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.191: Initializing POR dependencies: labels 175, guards 172
pins2lts-mc-linux64( 3/ 8), 0.339: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 3/ 8), 0.339: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.339: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.411: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.429: There are 176 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.429: State length is 188, there are 178 groups
pins2lts-mc-linux64( 0/ 8), 0.429: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.429: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.429: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.429: Visible groups: 0 / 178, labels: 2 / 176
pins2lts-mc-linux64( 0/ 8), 0.429: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.429: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.445: [Blue] ~120 levels ~960 states ~1432 transitions
pins2lts-mc-linux64( 0/ 8), 0.460: [Blue] ~223 levels ~1920 states ~3192 transitions
pins2lts-mc-linux64( 4/ 8), 0.494: [Blue] ~221 levels ~3840 states ~5648 transitions
pins2lts-mc-linux64( 4/ 8), 0.535: [Blue] ~221 levels ~7680 states ~10416 transitions
pins2lts-mc-linux64( 4/ 8), 0.607: [Blue] ~225 levels ~15360 states ~19792 transitions
pins2lts-mc-linux64( 4/ 8), 0.771: [Blue] ~225 levels ~30720 states ~39824 transitions
pins2lts-mc-linux64( 5/ 8), 1.085: [Blue] ~364 levels ~61440 states ~80616 transitions
pins2lts-mc-linux64( 4/ 8), 1.645: [Blue] ~225 levels ~122880 states ~160600 transitions
pins2lts-mc-linux64( 3/ 8), 2.643: [Blue] ~442 levels ~245760 states ~327048 transitions
pins2lts-mc-linux64( 3/ 8), 4.240: [Blue] ~442 levels ~491520 states ~665720 transitions
pins2lts-mc-linux64( 5/ 8), 6.914: [Blue] ~366 levels ~983040 states ~1338136 transitions
pins2lts-mc-linux64( 5/ 8), 11.649: [Blue] ~366 levels ~1966080 states ~2690104 transitions
pins2lts-mc-linux64( 5/ 8), 20.501: [Blue] ~366 levels ~3932160 states ~5372752 transitions
pins2lts-mc-linux64( 5/ 8), 38.821: [Blue] ~367 levels ~7864320 states ~10964176 transitions
pins2lts-mc-linux64( 5/ 8), 77.244: [Blue] ~367 levels ~15728640 states ~22295608 transitions
pins2lts-mc-linux64( 5/ 8), 155.443: [Blue] ~367 levels ~31457280 states ~46195152 transitions
pins2lts-mc-linux64( 7/ 8), 309.333: [Blue] ~357 levels ~62914560 states ~87677736 transitions
pins2lts-mc-linux64( 4/ 8), 626.159: [Blue] ~264 levels ~125829120 states ~188412648 transitions
pins2lts-mc-linux64( 2/ 8), 692.619: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 692.646:
pins2lts-mc-linux64( 0/ 8), 692.646: Explored 134215226 states 204557275 transitions, fanout: 1.524
pins2lts-mc-linux64( 0/ 8), 692.646: Total exploration time 692.200 sec (692.180 sec minimum, 692.191 sec on average)
pins2lts-mc-linux64( 0/ 8), 692.646: States per second: 193897, Transitions per second: 295518
pins2lts-mc-linux64( 0/ 8), 692.646:
pins2lts-mc-linux64( 0/ 8), 692.646: State space has 134217007 states, 107305447 are accepting
pins2lts-mc-linux64( 0/ 8), 692.646: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 692.646: blue states: 134215226 (100.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 692.646: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 692.646: all-red states: 134212729 (100.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 692.646:
pins2lts-mc-linux64( 0/ 8), 692.646: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 692.646:
pins2lts-mc-linux64( 0/ 8), 692.646: Queue width: 8B, total height: 3152, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 692.646: Tree memory: 1031.8MB, 8.1 B/state, compr.: 1.1%
pins2lts-mc-linux64( 0/ 8), 692.646: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 692.646: Stored 172 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 692.646: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 692.646: Est. total memory use: 1031.9MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8155150139382407252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8155150139382407252;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((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 06:03:03] [INFO ] Applying decomposition
[2024-05-29 06:03:03] [INFO ] Flatten gal took : 7 ms
[2024-05-29 06:03:03] [INFO ] Decomposing Gal with order
[2024-05-29 06:03:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:03:03] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-29 06:03:03] [INFO ] Flatten gal took : 27 ms
[2024-05-29 06:03:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 3 ms.
[2024-05-29 06:03:03] [INFO ] Time to serialize gal into /tmp/LTLFireability18252071860775615523.gal : 3 ms
[2024-05-29 06:03:03] [INFO ] Time to serialize properties into /tmp/LTLFireability18319209258037965197.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/LTLFireability18252071860775615523.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18319209258037965197.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 2 LTL properties
Checking formula 0 : !((G(F(("((i0.i1.i0.i0.i0.u42.p107==1)&&(i1.i0.i0.i0.i0.i0.i1.u81.p158==1))")||(G("((i0.i0.i1.i0.i0.i0.i0.i0.i0.u11.p16==1)&&(i0.i0.i1...181
Formula 0 simplified : G(F!"((i0.i0.i1.i0.i0.i0.i0.i0.i0.u11.p16==1)&&(i0.i0.i1.i0.i0.u22.p51==1))" & FG!"((i0.i1.i0.i0.i0.u42.p107==1)&&(i1.i0.i0.i0.i0.i0...174
Detected timeout of ITS tools.
[2024-05-29 06:24:20] [INFO ] Flatten gal took : 326 ms
[2024-05-29 06:24:21] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-29 06:24:21] [INFO ] Transformed 187 places.
[2024-05-29 06:24:21] [INFO ] Transformed 172 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 06:24:21] [INFO ] Time to serialize gal into /tmp/LTLFireability12434685819535692172.gal : 10 ms
[2024-05-29 06:24:21] [INFO ] Time to serialize properties into /tmp/LTLFireability9342977234936186331.ltl : 9 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/LTLFireability12434685819535692172.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9342977234936186331.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 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p107==1)&&(p158==1))")||(G("((p16==1)&&(p51==1))"))))))
Formula 0 simplified : G(F!"((p16==1)&&(p51==1))" & FG!"((p107==1)&&(p158==1))")
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 175664 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16058624 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="ShieldPPPs-PT-003B"
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 ShieldPPPs-PT-003B, 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-171683788900248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-003B.tgz
mv ShieldPPPs-PT-003B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;