About the Execution of 2023-gold for ShieldPPPs-PT-004A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
10352.823 | 3600000.00 | 6396555.00 | 8141.50 | TFF?FFFTF?FFTFFF | 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-171683788900253.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-004A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788900253
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 2.0K 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 6.8K Apr 13 11:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 13 11:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 13 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 13 11:50 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 35K 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-004A-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-004A-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716962958285
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-004A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 06:09:20] [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 06:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:09:20] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-29 06:09:20] [INFO ] Transformed 127 places.
[2024-05-29 06:09:20] [INFO ] Transformed 107 transitions.
[2024-05-29 06:09:20] [INFO ] Found NUPN structural information;
[2024-05-29 06:09:20] [INFO ] Parsed PT model containing 127 places and 107 transitions and 406 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-004A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 13 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:09:20] [INFO ] Computed 45 invariants in 11 ms
[2024-05-29 06:09:20] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-29 06:09:20] [INFO ] Invariant cache hit.
[2024-05-29 06:09:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-29 06:09:21] [INFO ] Invariant cache hit.
[2024-05-29 06:09:21] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 127/127 places, 107/107 transitions.
Support contains 47 out of 127 places after structural reductions.
[2024-05-29 06:09:21] [INFO ] Flatten gal took : 34 ms
[2024-05-29 06:09:21] [INFO ] Flatten gal took : 13 ms
[2024-05-29 06:09:21] [INFO ] Input system was already deterministic with 107 transitions.
Support contains 44 out of 127 places (down from 47) after GAL structural reductions.
Finished random walk after 8243 steps, including 25 resets, run visited all 30 properties in 151 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 104
Applied a total of 4 rules in 28 ms. Remains 124 /127 variables (removed 3) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 124 cols
[2024-05-29 06:09:21] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 06:09:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-29 06:09:22] [INFO ] Invariant cache hit.
[2024-05-29 06:09:22] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-29 06:09:22] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 06:09:22] [INFO ] Invariant cache hit.
[2024-05-29 06:09:22] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/127 places, 104/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 389 ms. Remains : 124/127 places, 104/107 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 223 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s72 0) (EQ s82 0) (EQ s12 0) (EQ s31 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 344 reset in 396 ms.
Product exploration explored 100000 steps with 347 reset in 315 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3964 steps, including 13 resets, run visited all 1 properties in 27 ms. (steps per millisecond=146 )
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 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 104/104 transitions.
Applied a total of 0 rules in 12 ms. Remains 124 /124 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-29 06:09:23] [INFO ] Invariant cache hit.
[2024-05-29 06:09:23] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 06:09:23] [INFO ] Invariant cache hit.
[2024-05-29 06:09:23] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-29 06:09:24] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 06:09:24] [INFO ] Invariant cache hit.
[2024-05-29 06:09:24] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 321 ms. Remains : 124/124 places, 104/104 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 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3177 steps, including 10 resets, run visited all 1 properties in 20 ms. (steps per millisecond=158 )
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 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 343 reset in 243 ms.
Product exploration explored 100000 steps with 344 reset in 278 ms.
Built C files in :
/tmp/ltsmin16589311648631712507
[2024-05-29 06:09:25] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2024-05-29 06:09:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:09:25] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2024-05-29 06:09:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:09:25] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2024-05-29 06:09:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:09:25] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16589311648631712507
Running compilation step : cd /tmp/ltsmin16589311648631712507;'/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 348 ms.
Running link step : cd /tmp/ltsmin16589311648631712507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin16589311648631712507;'/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/stateBased13295355169282408530.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 104/104 transitions.
Applied a total of 0 rules in 20 ms. Remains 124 /124 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-29 06:09:40] [INFO ] Invariant cache hit.
[2024-05-29 06:09:40] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-29 06:09:40] [INFO ] Invariant cache hit.
[2024-05-29 06:09:40] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-29 06:09:40] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 06:09:40] [INFO ] Invariant cache hit.
[2024-05-29 06:09:40] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 124/124 places, 104/104 transitions.
Built C files in :
/tmp/ltsmin14367933150942265616
[2024-05-29 06:09:40] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2024-05-29 06:09:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:09:40] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2024-05-29 06:09:40] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:09:40] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2024-05-29 06:09:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:09:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14367933150942265616
Running compilation step : cd /tmp/ltsmin14367933150942265616;'/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 209 ms.
Running link step : cd /tmp/ltsmin14367933150942265616;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14367933150942265616;'/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/stateBased1952635817191092218.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 06:09:55] [INFO ] Flatten gal took : 8 ms
[2024-05-29 06:09:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:09:55] [INFO ] Time to serialize gal into /tmp/LTL10541734281795535924.gal : 2 ms
[2024-05-29 06:09:55] [INFO ] Time to serialize properties into /tmp/LTL18079678056305340938.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/LTL10541734281795535924.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7361729557588176626.hoa' '-atoms' '/tmp/LTL18079678056305340938.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL18079678056305340938.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7361729557588176626.hoa
Detected timeout of ITS tools.
[2024-05-29 06:10:10] [INFO ] Flatten gal took : 7 ms
[2024-05-29 06:10:10] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:10:11] [INFO ] Time to serialize gal into /tmp/LTL15278475661203773816.gal : 2 ms
[2024-05-29 06:10:11] [INFO ] Time to serialize properties into /tmp/LTL15935129849567268568.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/LTL15278475661203773816.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15935129849567268568.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p73==0)||(p83==0))||((p13==0)||(p32==0)))"))))
Formula 0 simplified : FG!"(((p73==0)||(p83==0))||((p13==0)||(p32==0)))"
Detected timeout of ITS tools.
[2024-05-29 06:10:26] [INFO ] Flatten gal took : 9 ms
[2024-05-29 06:10:26] [INFO ] Applying decomposition
[2024-05-29 06:10:26] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph621945542552896575.txt' '-o' '/tmp/graph621945542552896575.bin' '-w' '/tmp/graph621945542552896575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph621945542552896575.bin' '-l' '-1' '-v' '-w' '/tmp/graph621945542552896575.weights' '-q' '0' '-e' '0.001'
[2024-05-29 06:10:26] [INFO ] Decomposing Gal with order
[2024-05-29 06:10:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:10:26] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 06:10:26] [INFO ] Flatten gal took : 62 ms
[2024-05-29 06:10:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 6 ms.
[2024-05-29 06:10:26] [INFO ] Time to serialize gal into /tmp/LTL17137231709459050297.gal : 3 ms
[2024-05-29 06:10:26] [INFO ] Time to serialize properties into /tmp/LTL10606145139185546769.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/LTL17137231709459050297.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10606145139185546769.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("(((i7.u26.p73==0)||(i7.u30.p83==0))||((i2.i1.u5.p13==0)||(i2.i1.u11.p32==0)))"))))
Formula 0 simplified : FG!"(((i7.u26.p73==0)||(i7.u30.p83==0))||((i2.i1.u5.p13==0)||(i2.i1.u11.p32==0)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16568233194737915992
[2024-05-29 06:10:41] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16568233194737915992
Running compilation step : cd /tmp/ltsmin16568233194737915992;'/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 179 ms.
Running link step : cd /tmp/ltsmin16568233194737915992;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16568233194737915992;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-00 finished in 94501 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)||G(p1)))))'
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:10:56] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 06:10:56] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-29 06:10:56] [INFO ] Invariant cache hit.
[2024-05-29 06:10:56] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-29 06:10:56] [INFO ] Invariant cache hit.
[2024-05-29 06:10:56] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s84 1), p1:(AND (EQ s78 1) (EQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 974 steps with 6 reset in 5 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-01 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X(F(p1))))&&(F(p2)||G(p3))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 06:10:56] [INFO ] Invariant cache hit.
[2024-05-29 06:10:57] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 06:10:57] [INFO ] Invariant cache hit.
[2024-05-29 06:10:57] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-05-29 06:10:57] [INFO ] Invariant cache hit.
[2024-05-29 06:10:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 326 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s62 0), p3:(OR (EQ s38 0) (EQ s40 0)), p0:(EQ s62 1), p1:(EQ s124 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9160 steps with 85 reset in 31 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-02 finished in 583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 11 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2024-05-29 06:10:57] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 06:10:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 06:10:57] [INFO ] Invariant cache hit.
[2024-05-29 06:10:57] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-29 06:10:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 06:10:57] [INFO ] Invariant cache hit.
[2024-05-29 06:10:57] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s87 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2534 reset in 257 ms.
Product exploration explored 100000 steps with 2542 reset in 247 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
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 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 06:10:58] [INFO ] Invariant cache hit.
[2024-05-29 06:10:58] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-29 06:10:58] [INFO ] Invariant cache hit.
[2024-05-29 06:10:59] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-29 06:10:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 06:10:59] [INFO ] Invariant cache hit.
[2024-05-29 06:10:59] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 309 ms. Remains : 125/125 places, 105/105 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
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 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2512 reset in 206 ms.
Product exploration explored 100000 steps with 2487 reset in 222 ms.
Built C files in :
/tmp/ltsmin2615554329367364378
[2024-05-29 06:11:00] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 06:11:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:11:00] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 06:11:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:11:00] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 06:11:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:11:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2615554329367364378
Running compilation step : cd /tmp/ltsmin2615554329367364378;'/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 230 ms.
Running link step : cd /tmp/ltsmin2615554329367364378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2615554329367364378;'/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/stateBased12101243871496032129.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 06:11:15] [INFO ] Invariant cache hit.
[2024-05-29 06:11:15] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-29 06:11:15] [INFO ] Invariant cache hit.
[2024-05-29 06:11:15] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-29 06:11:15] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 06:11:15] [INFO ] Invariant cache hit.
[2024-05-29 06:11:15] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 322 ms. Remains : 125/125 places, 105/105 transitions.
Built C files in :
/tmp/ltsmin1029146241288498862
[2024-05-29 06:11:15] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 06:11:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:11:15] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 06:11:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:11:15] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 06:11:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:11:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1029146241288498862
Running compilation step : cd /tmp/ltsmin1029146241288498862;'/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 215 ms.
Running link step : cd /tmp/ltsmin1029146241288498862;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1029146241288498862;'/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/stateBased11234118163769272128.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 06:11:30] [INFO ] Flatten gal took : 21 ms
[2024-05-29 06:11:30] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:11:30] [INFO ] Time to serialize gal into /tmp/LTL1610997528648253237.gal : 2 ms
[2024-05-29 06:11:30] [INFO ] Time to serialize properties into /tmp/LTL17055511960124045273.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/LTL1610997528648253237.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13946202631075624726.hoa' '-atoms' '/tmp/LTL17055511960124045273.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17055511960124045273.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13946202631075624726.hoa
Detected timeout of ITS tools.
[2024-05-29 06:11:45] [INFO ] Flatten gal took : 7 ms
[2024-05-29 06:11:45] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:11:45] [INFO ] Time to serialize gal into /tmp/LTL16192590219359482108.gal : 1 ms
[2024-05-29 06:11:45] [INFO ] Time to serialize properties into /tmp/LTL6268727872195017743.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/LTL16192590219359482108.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6268727872195017743.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("((p66==0)||(p87==0))"))))
Formula 0 simplified : FG!"((p66==0)||(p87==0))"
Detected timeout of ITS tools.
[2024-05-29 06:12:00] [INFO ] Flatten gal took : 11 ms
[2024-05-29 06:12:00] [INFO ] Applying decomposition
[2024-05-29 06:12:00] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15989345677951501628.txt' '-o' '/tmp/graph15989345677951501628.bin' '-w' '/tmp/graph15989345677951501628.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15989345677951501628.bin' '-l' '-1' '-v' '-w' '/tmp/graph15989345677951501628.weights' '-q' '0' '-e' '0.001'
[2024-05-29 06:12:00] [INFO ] Decomposing Gal with order
[2024-05-29 06:12:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:12:00] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 06:12:00] [INFO ] Flatten gal took : 13 ms
[2024-05-29 06:12:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2024-05-29 06:12:00] [INFO ] Time to serialize gal into /tmp/LTL9612882441456650016.gal : 2 ms
[2024-05-29 06:12:00] [INFO ] Time to serialize properties into /tmp/LTL3123182994584012932.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/LTL9612882441456650016.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3123182994584012932.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F("((i7.i1.u23.p66==0)||(i7.i1.u31.p87==0))"))))
Formula 0 simplified : FG!"((i7.i1.u23.p66==0)||(i7.i1.u31.p87==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6932233054796489067
[2024-05-29 06:12:15] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6932233054796489067
Running compilation step : cd /tmp/ltsmin6932233054796489067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin6932233054796489067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin6932233054796489067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-03 finished in 93495 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((X(X((G(p1)||F(G(p2)))))&&p0)))'
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:12:31] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 06:12:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 06:12:31] [INFO ] Invariant cache hit.
[2024-05-29 06:12:31] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 06:12:31] [INFO ] Invariant cache hit.
[2024-05-29 06:12:31] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=1 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=4 dest: 2}]], initial=0, aps=[p0:(AND (EQ s93 1) (EQ s59 1)), p1:(AND (EQ s17 1) (EQ s19 1)), p2:(AND (EQ s82 1) (EQ s103 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 279 steps with 0 reset in 2 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-04 finished in 609 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||X(F(p1))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 9 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2024-05-29 06:12:31] [INFO ] Computed 45 invariants in 5 ms
[2024-05-29 06:12:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 06:12:31] [INFO ] Invariant cache hit.
[2024-05-29 06:12:31] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-29 06:12:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:12:31] [INFO ] Invariant cache hit.
[2024-05-29 06:12:31] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s29 1)), p1:(AND (EQ s39 1) (EQ s60 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 1290 reset in 237 ms.
Product exploration explored 100000 steps with 1289 reset in 244 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 p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 83 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 122 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 06:12:32] [INFO ] Invariant cache hit.
[2024-05-29 06:12:33] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-29 06:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:33] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-29 06:12:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:12:33] [INFO ] [Nat]Absence check using 45 positive place invariants in 8 ms returned sat
[2024-05-29 06:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:33] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2024-05-29 06:12:33] [INFO ] Computed and/alt/rep : 104/295/104 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-29 06:12:33] [INFO ] Added : 89 causal constraints over 19 iterations in 287 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 06:12:33] [INFO ] Invariant cache hit.
[2024-05-29 06:12:33] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-29 06:12:33] [INFO ] Invariant cache hit.
[2024-05-29 06:12:33] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-29 06:12:33] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:12:33] [INFO ] Invariant cache hit.
[2024-05-29 06:12:33] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 306 ms. Remains : 125/125 places, 105/105 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 p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 223 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=74 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 125 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 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-29 06:12:34] [INFO ] Invariant cache hit.
[2024-05-29 06:12:34] [INFO ] [Real]Absence check using 45 positive place invariants in 11 ms returned sat
[2024-05-29 06:12:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:34] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-29 06:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:12:34] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-29 06:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:34] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-29 06:12:34] [INFO ] Computed and/alt/rep : 104/295/104 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-29 06:12:34] [INFO ] Added : 89 causal constraints over 19 iterations in 289 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 95581 steps with 1227 reset in 231 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-05 finished in 3688 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(X((!X(p0)&&p1))) U p2) U p0))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:12:35] [INFO ] Computed 45 invariants in 7 ms
[2024-05-29 06:12:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 06:12:35] [INFO ] Invariant cache hit.
[2024-05-29 06:12:35] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-29 06:12:35] [INFO ] Invariant cache hit.
[2024-05-29 06:12:35] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 299 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (OR (NOT p2) (AND (NOT p0) p1)), (NOT p0), (AND p1 (NOT p0)), true]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=p2, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s106 1) (EQ s126 1)), p2:(AND (EQ s47 1) (EQ s64 1)), p1:(EQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-06 finished in 516 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 06:12:35] [INFO ] Invariant cache hit.
[2024-05-29 06:12:35] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 06:12:35] [INFO ] Invariant cache hit.
[2024-05-29 06:12:36] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-29 06:12:36] [INFO ] Invariant cache hit.
[2024-05-29 06:12:36] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s78 0) (EQ s93 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Product exploration explored 100000 steps with 50000 reset in 214 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 : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldPPPs-PT-004A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-004A-LTLFireability-07 finished in 908 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 06:12:36] [INFO ] Invariant cache hit.
[2024-05-29 06:12:36] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-29 06:12:36] [INFO ] Invariant cache hit.
[2024-05-29 06:12:36] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-29 06:12:36] [INFO ] Invariant cache hit.
[2024-05-29 06:12:37] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 304 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s106 0) (EQ s126 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 60 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-08 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 06:12:37] [INFO ] Invariant cache hit.
[2024-05-29 06:12:37] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 06:12:37] [INFO ] Invariant cache hit.
[2024-05-29 06:12:37] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-29 06:12:37] [INFO ] Invariant cache hit.
[2024-05-29 06:12:37] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s29 1)), p1:(AND (EQ s51 1) (EQ s72 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1233 reset in 229 ms.
Product exploration explored 100000 steps with 1235 reset in 259 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 p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 91 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Finished random walk after 126 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=18 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 151 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
[2024-05-29 06:12:38] [INFO ] Invariant cache hit.
[2024-05-29 06:12:38] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-29 06:12:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:38] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-29 06:12:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:12:39] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-29 06:12:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:39] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-29 06:12:39] [INFO ] Computed and/alt/rep : 106/291/106 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-29 06:12:39] [INFO ] Added : 83 causal constraints over 18 iterations in 281 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 06:12:39] [INFO ] Invariant cache hit.
[2024-05-29 06:12:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 06:12:39] [INFO ] Invariant cache hit.
[2024-05-29 06:12:39] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-29 06:12:39] [INFO ] Invariant cache hit.
[2024-05-29 06:12:39] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 127/127 places, 107/107 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 p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Finished random walk after 114 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=22 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
[2024-05-29 06:12:40] [INFO ] Invariant cache hit.
[2024-05-29 06:12:40] [INFO ] [Real]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-29 06:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:40] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-29 06:12:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:12:40] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-29 06:12:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 06:12:40] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-29 06:12:40] [INFO ] Computed and/alt/rep : 106/291/106 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 06:12:41] [INFO ] Added : 83 causal constraints over 18 iterations in 276 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 1221 reset in 224 ms.
Product exploration explored 100000 steps with 1211 reset in 242 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (AND p0 (NOT p1)), p0]
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 107
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 19 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-29 06:12:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:12:42] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 06:12:42] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/127 places, 107/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 127/127 places, 107/107 transitions.
Built C files in :
/tmp/ltsmin5952666904704197924
[2024-05-29 06:12:42] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5952666904704197924
Running compilation step : cd /tmp/ltsmin5952666904704197924;'/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 205 ms.
Running link step : cd /tmp/ltsmin5952666904704197924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5952666904704197924;'/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/stateBased1761296334228303587.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:12:57] [INFO ] Computed 45 invariants in 3 ms
[2024-05-29 06:12:57] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 06:12:57] [INFO ] Invariant cache hit.
[2024-05-29 06:12:57] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2024-05-29 06:12:57] [INFO ] Invariant cache hit.
[2024-05-29 06:12:57] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 391 ms. Remains : 127/127 places, 107/107 transitions.
Built C files in :
/tmp/ltsmin902211735009508183
[2024-05-29 06:12:57] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin902211735009508183
Running compilation step : cd /tmp/ltsmin902211735009508183;'/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 180 ms.
Running link step : cd /tmp/ltsmin902211735009508183;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin902211735009508183;'/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/stateBased17318022800727259214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 06:13:12] [INFO ] Flatten gal took : 8 ms
[2024-05-29 06:13:12] [INFO ] Flatten gal took : 5 ms
[2024-05-29 06:13:12] [INFO ] Time to serialize gal into /tmp/LTL3934834906215592622.gal : 2 ms
[2024-05-29 06:13:12] [INFO ] Time to serialize properties into /tmp/LTL10016769836659247378.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/LTL3934834906215592622.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6636970108825200112.hoa' '-atoms' '/tmp/LTL10016769836659247378.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/LTL10016769836659247378.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6636970108825200112.hoa
Detected timeout of ITS tools.
[2024-05-29 06:13:27] [INFO ] Flatten gal took : 6 ms
[2024-05-29 06:13:27] [INFO ] Flatten gal took : 5 ms
[2024-05-29 06:13:27] [INFO ] Time to serialize gal into /tmp/LTL9107595919143684339.gal : 1 ms
[2024-05-29 06:13:27] [INFO ] Time to serialize properties into /tmp/LTL4990252603917278757.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/LTL9107595919143684339.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4990252603917278757.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F(!("((p8==1)&&(p29==1))")))U(X("((p51==1)&&(p72==1))"))))
Formula 0 simplified : G"((p8==1)&&(p29==1))" R X!"((p51==1)&&(p72==1))"
Detected timeout of ITS tools.
[2024-05-29 06:13:42] [INFO ] Flatten gal took : 9 ms
[2024-05-29 06:13:42] [INFO ] Applying decomposition
[2024-05-29 06:13:42] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15528921832693533333.txt' '-o' '/tmp/graph15528921832693533333.bin' '-w' '/tmp/graph15528921832693533333.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15528921832693533333.bin' '-l' '-1' '-v' '-w' '/tmp/graph15528921832693533333.weights' '-q' '0' '-e' '0.001'
[2024-05-29 06:13:42] [INFO ] Decomposing Gal with order
[2024-05-29 06:13:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:13:42] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 06:13:43] [INFO ] Flatten gal took : 24 ms
[2024-05-29 06:13:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 5 ms.
[2024-05-29 06:13:43] [INFO ] Time to serialize gal into /tmp/LTL17727936588749451635.gal : 2 ms
[2024-05-29 06:13:43] [INFO ] Time to serialize properties into /tmp/LTL4739132259725234432.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/LTL17727936588749451635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4739132259725234432.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F(!("((i2.u3.p8==1)&&(i2.u10.p29==1))")))U(X("((i3.u19.p51==1)&&(i6.u26.p72==1))"))))
Formula 0 simplified : G"((i2.u3.p8==1)&&(i2.u10.p29==1))" R X!"((i3.u19.p51==1)&&(i6.u26.p72==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5604949016209913245
[2024-05-29 06:13:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5604949016209913245
Running compilation step : cd /tmp/ltsmin5604949016209913245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 197 ms.
Running link step : cd /tmp/ltsmin5604949016209913245;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5604949016209913245;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>(!(LTLAPp0==true)) U X((LTLAPp1==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-004A-LTLFireability-09 finished in 96080 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 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 104
Applied a total of 4 rules in 9 ms. Remains 124 /127 variables (removed 3) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 124 cols
[2024-05-29 06:14:13] [INFO ] Computed 45 invariants in 2 ms
[2024-05-29 06:14:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 06:14:13] [INFO ] Invariant cache hit.
[2024-05-29 06:14:13] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-29 06:14:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 06:14:13] [INFO ] Invariant cache hit.
[2024-05-29 06:14:13] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/127 places, 104/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 310 ms. Remains : 124/127 places, 104/107 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s16 0) (EQ s18 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 338 reset in 235 ms.
Product exploration explored 100000 steps with 340 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 41 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
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 86 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 28 ms :[(NOT p0)]
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 104/104 transitions.
Applied a total of 0 rules in 10 ms. Remains 124 /124 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-05-29 06:14:14] [INFO ] Invariant cache hit.
[2024-05-29 06:14:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 06:14:14] [INFO ] Invariant cache hit.
[2024-05-29 06:14:14] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-29 06:14:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:14:14] [INFO ] Invariant cache hit.
[2024-05-29 06:14:14] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 291 ms. Remains : 124/124 places, 104/104 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 72 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 35 ms :[(NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
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 130 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 341 reset in 232 ms.
Product exploration explored 100000 steps with 343 reset in 254 ms.
Built C files in :
/tmp/ltsmin4570462005757976401
[2024-05-29 06:14:15] [INFO ] Computing symmetric may disable matrix : 104 transitions.
[2024-05-29 06:14:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:15] [INFO ] Computing symmetric may enable matrix : 104 transitions.
[2024-05-29 06:14:15] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:15] [INFO ] Computing Do-Not-Accords matrix : 104 transitions.
[2024-05-29 06:14:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:15] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4570462005757976401
Running compilation step : cd /tmp/ltsmin4570462005757976401;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 239 ms.
Running link step : cd /tmp/ltsmin4570462005757976401;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4570462005757976401;'/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/stateBased1562160544147498813.hoa' '--buchi-type=spotba'
LTSmin run took 226 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004A-LTLFireability-10 finished in 2830 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 5 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2024-05-29 06:14:16] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 06:14:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 06:14:16] [INFO ] Invariant cache hit.
[2024-05-29 06:14:16] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-29 06:14:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 06:14:16] [INFO ] Invariant cache hit.
[2024-05-29 06:14:16] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 298 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s91 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11170 reset in 160 ms.
Product exploration explored 100000 steps with 11139 reset in 183 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-05-29 06:14:17] [INFO ] Invariant cache hit.
[2024-05-29 06:14:17] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 06:14:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 06:14:17] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-29 06:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:14:17] [INFO ] [Nat]Absence check using 45 positive place invariants in 9 ms returned sat
[2024-05-29 06:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 06:14:17] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-29 06:14:17] [INFO ] Computed and/alt/rep : 104/295/104 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-29 06:14:17] [INFO ] Added : 92 causal constraints over 19 iterations in 381 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 06:14:17] [INFO ] Invariant cache hit.
[2024-05-29 06:14:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-29 06:14:17] [INFO ] Invariant cache hit.
[2024-05-29 06:14:17] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-29 06:14:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:14:17] [INFO ] Invariant cache hit.
[2024-05-29 06:14:18] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 125/125 places, 105/105 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-29 06:14:18] [INFO ] Invariant cache hit.
[2024-05-29 06:14:18] [INFO ] [Real]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 06:14:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 06:14:18] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-29 06:14:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 06:14:18] [INFO ] [Nat]Absence check using 45 positive place invariants in 10 ms returned sat
[2024-05-29 06:14:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 06:14:18] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-29 06:14:18] [INFO ] Computed and/alt/rep : 104/295/104 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-29 06:14:19] [INFO ] Added : 92 causal constraints over 19 iterations in 346 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11171 reset in 170 ms.
Product exploration explored 100000 steps with 11118 reset in 201 ms.
Built C files in :
/tmp/ltsmin10005558071280683988
[2024-05-29 06:14:19] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 06:14:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:19] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 06:14:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:19] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 06:14:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10005558071280683988
Running compilation step : cd /tmp/ltsmin10005558071280683988;'/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 199 ms.
Running link step : cd /tmp/ltsmin10005558071280683988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10005558071280683988;'/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/stateBased8164928741422676130.hoa' '--buchi-type=spotba'
LTSmin run took 125 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004A-LTLFireability-12 finished in 3728 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((F((p0&&G(p1)))&&G(p2))))'
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 6 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
[2024-05-29 06:14:19] [INFO ] Invariant cache hit.
[2024-05-29 06:14:19] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-29 06:14:19] [INFO ] Invariant cache hit.
[2024-05-29 06:14:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-29 06:14:20] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:14:20] [INFO ] Invariant cache hit.
[2024-05-29 06:14:20] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 281 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (OR (EQ s1 0) (EQ s26 0)) (OR (EQ s6 0) (EQ s23 0))), p0:(OR (EQ s11 0) (EQ s23 0)), p1:(OR (EQ s6 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 338 reset in 253 ms.
Product exploration explored 100000 steps with 334 reset in 262 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 p2 p0 p1), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (AND p0 p1)), (X p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (AND p0 p1))), (X (X p1)), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 220 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Finished random walk after 70 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (AND p0 p1)), (X p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (AND p0 p1))), (X (X p1)), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 347 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Support contains 5 out of 125 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 125/125 places, 105/105 transitions.
Applied a total of 0 rules in 16 ms. Remains 125 /125 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2024-05-29 06:14:21] [INFO ] Invariant cache hit.
[2024-05-29 06:14:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-29 06:14:21] [INFO ] Invariant cache hit.
[2024-05-29 06:14:22] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-29 06:14:22] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:14:22] [INFO ] Invariant cache hit.
[2024-05-29 06:14:22] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 125/125 places, 105/105 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 p2 p0 p1), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (AND p0 p1)), (X p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (AND p0 p1))), (X (X p1)), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Finished random walk after 90 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (AND p0 p1)), (X p1), (X p2), (X (AND p0 p1 p2)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p1) p2))))), (X (X (AND p0 p1))), (X (X p1)), (X (X p2)), (X (X (AND p0 p1 p2))), (X (X (NOT (OR (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (OR (NOT p0) (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p0 p1 p2))), (F (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))]
Knowledge based reduction with 13 factoid took 322 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 339 reset in 271 ms.
Product exploration explored 100000 steps with 335 reset in 271 ms.
Built C files in :
/tmp/ltsmin851695899041780443
[2024-05-29 06:14:23] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2024-05-29 06:14:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:23] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2024-05-29 06:14:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:23] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2024-05-29 06:14:23] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:23] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin851695899041780443
Running compilation step : cd /tmp/ltsmin851695899041780443;'/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 223 ms.
Running link step : cd /tmp/ltsmin851695899041780443;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin851695899041780443;'/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/stateBased17924803429904026703.hoa' '--buchi-type=spotba'
LTSmin run took 481 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldPPPs-PT-004A-LTLFireability-13 finished in 4886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p1||X(F(p2))))&&p0)))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Applied a total of 0 rules in 1 ms. Remains 127 /127 variables (removed 0) and now considering 107/107 (removed 0) transitions.
// Phase 1: matrix 107 rows 127 cols
[2024-05-29 06:14:24] [INFO ] Computed 45 invariants in 1 ms
[2024-05-29 06:14:24] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 06:14:24] [INFO ] Invariant cache hit.
[2024-05-29 06:14:24] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-29 06:14:24] [INFO ] Invariant cache hit.
[2024-05-29 06:14:24] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 127/127 places, 107/107 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(AND (EQ s99 1) (EQ s116 1)), p1:(AND (EQ s67 1) (EQ s86 1)), p2:(AND (EQ s99 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-14 finished in 424 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(((p1||F(p2))&&p0))))'
Support contains 7 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 107/107 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 125 transition count 105
Applied a total of 4 rules in 9 ms. Remains 125 /127 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 125 cols
[2024-05-29 06:14:25] [INFO ] Computed 45 invariants in 8 ms
[2024-05-29 06:14:25] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-29 06:14:25] [INFO ] Invariant cache hit.
[2024-05-29 06:14:25] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-29 06:14:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 06:14:25] [INFO ] Invariant cache hit.
[2024-05-29 06:14:25] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/127 places, 105/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 125/127 places, 105/107 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-004A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s56 1)), p1:(AND (EQ s37 1) (EQ s53 1) (OR (EQ s83 1) (AND (EQ s8 1) (EQ s29 1)))), p2:(EQ s83 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 752 steps with 6 reset in 4 ms.
FORMULA ShieldPPPs-PT-004A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-004A-LTLFireability-15 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U X(p1)))'
[2024-05-29 06:14:25] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1897216977308620656
[2024-05-29 06:14:25] [INFO ] Applying decomposition
[2024-05-29 06:14:25] [INFO ] Computing symmetric may disable matrix : 107 transitions.
[2024-05-29 06:14:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:25] [INFO ] Computing symmetric may enable matrix : 107 transitions.
[2024-05-29 06:14:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:25] [INFO ] Flatten gal took : 5 ms
[2024-05-29 06:14:25] [INFO ] Computing Do-Not-Accords matrix : 107 transitions.
[2024-05-29 06:14:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 06:14:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1897216977308620656
Running compilation step : cd /tmp/ltsmin1897216977308620656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5756921377765722646.txt' '-o' '/tmp/graph5756921377765722646.bin' '-w' '/tmp/graph5756921377765722646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5756921377765722646.bin' '-l' '-1' '-v' '-w' '/tmp/graph5756921377765722646.weights' '-q' '0' '-e' '0.001'
[2024-05-29 06:14:25] [INFO ] Decomposing Gal with order
[2024-05-29 06:14:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:14:25] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-29 06:14:25] [INFO ] Flatten gal took : 9 ms
[2024-05-29 06:14:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 5 ms.
[2024-05-29 06:14:25] [INFO ] Time to serialize gal into /tmp/LTLFireability8260757320726192737.gal : 2 ms
[2024-05-29 06:14:25] [INFO ] Time to serialize properties into /tmp/LTLFireability9999317510690807406.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/LTLFireability8260757320726192737.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9999317510690807406.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((G(F("(((i7.u26.p73==0)||(i7.u30.p83==0))||((i2.i1.u5.p13==0)||(i2.i1.u11.p32==0)))"))))
Formula 0 simplified : FG!"(((i7.u26.p73==0)||(i7.u30.p83==0))||((i2.i1.u5.p13==0)||(i2.i1.u11.p32==0)))"
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin1897216977308620656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1897216977308620656;'/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)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t9, t10, t11, t18, t19, t20, t27, t28, t61, i0.t94, i0.t92, i0.u10.t5, i0.u10.t6,...767
Computing Next relation with stutter on 366786 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.000: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 111, guards 107
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.051: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 5/ 8), 0.051: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.051: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.086: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.088: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.094: There are 113 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 128, there are 110 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.094: Visible groups: 0 / 110, labels: 1 / 113
pins2lts-mc-linux64( 0/ 8), 0.094: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.140: [Blue] ~120 levels ~960 states ~3016 transitions
pins2lts-mc-linux64( 2/ 8), 0.167: [Blue] ~240 levels ~1920 states ~6208 transitions
pins2lts-mc-linux64( 7/ 8), 0.206: [Blue] ~308 levels ~3840 states ~10168 transitions
pins2lts-mc-linux64( 7/ 8), 0.246: [Blue] ~308 levels ~7680 states ~16208 transitions
pins2lts-mc-linux64( 3/ 8), 0.329: [Blue] ~245 levels ~15360 states ~39216 transitions
pins2lts-mc-linux64( 2/ 8), 0.485: [Blue] ~380 levels ~30720 states ~73680 transitions
pins2lts-mc-linux64( 7/ 8), 0.762: [Blue] ~309 levels ~61440 states ~112896 transitions
pins2lts-mc-linux64( 7/ 8), 1.314: [Blue] ~317 levels ~122880 states ~228384 transitions
pins2lts-mc-linux64( 7/ 8), 2.200: [Blue] ~318 levels ~245760 states ~473672 transitions
pins2lts-mc-linux64( 7/ 8), 3.524: [Blue] ~318 levels ~491520 states ~942824 transitions
pins2lts-mc-linux64( 7/ 8), 5.871: [Blue] ~320 levels ~983040 states ~2001208 transitions
pins2lts-mc-linux64( 7/ 8), 10.085: [Blue] ~320 levels ~1966080 states ~4185408 transitions
pins2lts-mc-linux64( 7/ 8), 17.819: [Blue] ~320 levels ~3932160 states ~8176944 transitions
pins2lts-mc-linux64( 7/ 8), 32.905: [Blue] ~320 levels ~7864320 states ~16282640 transitions
pins2lts-mc-linux64( 7/ 8), 65.431: [Blue] ~374 levels ~15728640 states ~34786448 transitions
pins2lts-mc-linux64( 7/ 8), 131.485: [Blue] ~2406 levels ~31457280 states ~75975712 transitions
pins2lts-mc-linux64( 7/ 8), 295.589: [Blue] ~185932 levels ~62914560 states ~172241184 transitions
pins2lts-mc-linux64( 6/ 8), 641.542: [Blue] ~190500 levels ~125829120 states ~382808928 transitions
pins2lts-mc-linux64( 0/ 8), 786.565: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 786.637:
pins2lts-mc-linux64( 0/ 8), 786.637: Explored 134288659 states 406852976 transitions, fanout: 3.030
pins2lts-mc-linux64( 0/ 8), 786.637: Total exploration time 786.500 sec (786.450 sec minimum, 786.474 sec on average)
pins2lts-mc-linux64( 0/ 8), 786.637: States per second: 170742, Transitions per second: 517296
pins2lts-mc-linux64( 0/ 8), 786.637:
pins2lts-mc-linux64( 0/ 8), 786.637: State space has 134217220 states, 3348025 are accepting
pins2lts-mc-linux64( 0/ 8), 786.637: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 786.637: blue states: 134288659 (100.05%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 786.637: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 786.637: all-red states: 3348025 (2.49%), bogus 14 (0.00%)
pins2lts-mc-linux64( 0/ 8), 786.637:
pins2lts-mc-linux64( 0/ 8), 786.637: Total memory used for local state coloring: 43.2MB
pins2lts-mc-linux64( 0/ 8), 786.637:
pins2lts-mc-linux64( 0/ 8), 786.637: Queue width: 8B, total height: 2828219, memory: 21.58MB
pins2lts-mc-linux64( 0/ 8), 786.637: Tree memory: 1050.0MB, 8.2 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 786.637: Tree fill ratio (roots/leafs): 99.0%/10.0%
pins2lts-mc-linux64( 0/ 8), 786.637: Stored 109 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 786.637: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 786.637: Est. total memory use: 1071.6MB (~1045.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1897216977308620656;'/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)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1897216977308620656;'/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)))' '--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:36:06] [INFO ] Applying decomposition
[2024-05-29 06:36:06] [INFO ] Flatten gal took : 8 ms
[2024-05-29 06:36:06] [INFO ] Decomposing Gal with order
[2024-05-29 06:36:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 06:36:06] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-29 06:36:06] [INFO ] Flatten gal took : 11 ms
[2024-05-29 06:36:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 2 ms.
[2024-05-29 06:36:06] [INFO ] Time to serialize gal into /tmp/LTLFireability12531046337717366646.gal : 1 ms
[2024-05-29 06:36:06] [INFO ] Time to serialize properties into /tmp/LTLFireability17718305028971440931.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/LTLFireability12531046337717366646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17718305028971440931.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 3 LTL properties
Checking formula 0 : !((G(F("(((i19.u35.p73==0)||(u40.p83==0))||((i3.u8.p13==0)||(u15.p32==0)))"))))
Formula 0 simplified : FG!"(((i19.u35.p73==0)||(u40.p83==0))||((i3.u8.p13==0)||(u15.p32==0)))"
Reverse transition relation is NOT exact ! Due to transitions t47, t49, t53, t54, t58, t60, t63, t65, t66, t67, t75, t76, t77, t79, t83, t84, t88, t89, t94...602
Computing Next relation with stutter on 366786 deadlock states
305 unique states visited
0 strongly connected components in search stack
608 transitions explored
305 items max in DFS search stack
127256 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1272.6,4726704,1,0,5.52266e+06,171,619,2.77736e+07,74,383,3583533
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldPPPs-PT-004A-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F("((u30.p66==0)||(u41.p87==0))"))))
Formula 1 simplified : FG!"((u30.p66==0)||(u41.p87==0))"
Computing Next relation with stutter on 366786 deadlock states
Detected timeout of ITS tools.
[2024-05-29 06:57:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 06:57:48] [INFO ] Input system was already deterministic with 107 transitions.
[2024-05-29 06:57:48] [INFO ] Transformed 127 places.
[2024-05-29 06:57:48] [INFO ] Transformed 107 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:57:48] [INFO ] Time to serialize gal into /tmp/LTLFireability7439094722293880616.gal : 2 ms
[2024-05-29 06:57:48] [INFO ] Time to serialize properties into /tmp/LTLFireability14969849425030981016.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/LTLFireability7439094722293880616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14969849425030981016.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("((p66==0)||(p87==0))"))))
Formula 0 simplified : FG!"((p66==0)||(p87==0))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...458
Computing Next relation with stutter on 366786 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5699660 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16037464 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-004A"
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-004A, 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-171683788900253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-004A.tgz
mv ShieldPPPs-PT-004A 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 ;