About the Execution of ITS-Tools for ShieldPPPs-PT-002B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8635.012 | 3600000.00 | 6329694.00 | 19392.50 | FFFFTTFTTF?FFTT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r222-tall-165286025100379.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-002B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025100379
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 296K
-rw-r--r-- 1 mcc users 8.1K Apr 30 03:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 30 03:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 03:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 30 03:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 35K May 10 09:34 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-002B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-002B-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652973041769
Running Version 202205111006
[2022-05-19 15:10:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 15:10:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:10:43] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2022-05-19 15:10:43] [INFO ] Transformed 139 places.
[2022-05-19 15:10:43] [INFO ] Transformed 129 transitions.
[2022-05-19 15:10:43] [INFO ] Found NUPN structural information;
[2022-05-19 15:10:43] [INFO ] Parsed PT model containing 139 places and 129 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-002B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 128 transition count 118
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 128 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 127 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 127 transition count 117
Applied a total of 24 rules in 28 ms. Remains 127 /139 variables (removed 12) and now considering 117/129 (removed 12) transitions.
// Phase 1: matrix 117 rows 127 cols
[2022-05-19 15:10:43] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-19 15:10:43] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 117 rows 127 cols
[2022-05-19 15:10:43] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-19 15:10:43] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
// Phase 1: matrix 117 rows 127 cols
[2022-05-19 15:10:43] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:10:43] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/139 places, 117/129 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/139 places, 117/129 transitions.
Support contains 24 out of 127 places after structural reductions.
[2022-05-19 15:10:43] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-19 15:10:43] [INFO ] Flatten gal took : 34 ms
FORMULA ShieldPPPs-PT-002B-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-19 15:10:43] [INFO ] Flatten gal took : 12 ms
[2022-05-19 15:10:43] [INFO ] Input system was already deterministic with 117 transitions.
Support contains 23 out of 127 places (down from 24) after GAL structural reductions.
Finished random walk after 370 steps, including 1 resets, run visited all 15 properties in 449 ms. (steps per millisecond=0 )
FORMULA ShieldPPPs-PT-002B-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 25 stabilizing places and 25 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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, 117/117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 126 transition count 101
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 111 transition count 101
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 30 place count 111 transition count 91
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 50 place count 101 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 53 place count 98 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 56 place count 98 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 56 place count 98 transition count 87
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 97 transition count 87
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 118 place count 67 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 65 transition count 55
Applied a total of 120 rules in 32 ms. Remains 65 /127 variables (removed 62) and now considering 55/117 (removed 62) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:44] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:10:44] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:44] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:10:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2022-05-19 15:10:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:44] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:10:44] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/127 places, 55/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/127 places, 55/117 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s44 0) (NEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1978 reset in 316 ms.
Product exploration explored 100000 steps with 1965 reset in 186 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:46] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:10:46] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2022-05-19 15:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:10:46] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-19 15:10:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:10:46] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2022-05-19 15:10:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:10:46] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-19 15:10:46] [INFO ] Computed and/alt/rep : 52/117/52 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-19 15:10:46] [INFO ] Added : 43 causal constraints over 9 iterations in 197 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 5 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:46] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:10:46] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:46] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:10:46] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-05-19 15:10:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:46] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-19 15:10:46] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 17 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:10:47] [INFO ] Computed 23 place invariants in 15 ms
[2022-05-19 15:10:47] [INFO ] [Real]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 15:10:47] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-19 15:10:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 15:10:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2022-05-19 15:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 15:10:47] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-19 15:10:47] [INFO ] Computed and/alt/rep : 52/117/52 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-19 15:10:47] [INFO ] Added : 43 causal constraints over 9 iterations in 78 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1986 reset in 162 ms.
Product exploration explored 100000 steps with 1992 reset in 183 ms.
Built C files in :
/tmp/ltsmin17990592220621165052
[2022-05-19 15:10:47] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2022-05-19 15:10:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:10:47] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2022-05-19 15:10:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:10:47] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2022-05-19 15:10:47] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:10:47] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17990592220621165052
Running compilation step : cd /tmp/ltsmin17990592220621165052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 243 ms.
Running link step : cd /tmp/ltsmin17990592220621165052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin17990592220621165052;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7715080822381375223.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 65 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 65/65 places, 55/55 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 55/55 (removed 0) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:11:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:11:03] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:11:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:11:03] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2022-05-19 15:11:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:11:03] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:11:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 55/55 transitions.
Built C files in :
/tmp/ltsmin4711460832360605149
[2022-05-19 15:11:03] [INFO ] Computing symmetric may disable matrix : 55 transitions.
[2022-05-19 15:11:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:11:03] [INFO ] Computing symmetric may enable matrix : 55 transitions.
[2022-05-19 15:11:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:11:03] [INFO ] Computing Do-Not-Accords matrix : 55 transitions.
[2022-05-19 15:11:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:11:03] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4711460832360605149
Running compilation step : cd /tmp/ltsmin4711460832360605149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 138 ms.
Running link step : cd /tmp/ltsmin4711460832360605149;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4711460832360605149;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11155355438962338335.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:11:18] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:11:18] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:11:18] [INFO ] Time to serialize gal into /tmp/LTL3792016357891384735.gal : 1 ms
[2022-05-19 15:11:18] [INFO ] Time to serialize properties into /tmp/LTL1757653574737976536.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3792016357891384735.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1757653574737976536.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3792016...266
Read 1 LTL properties
Checking formula 0 : !((G(F("((p93!=0)&&(p6!=1))"))))
Formula 0 simplified : !GF"((p93!=0)&&(p6!=1))"
Reverse transition relation is NOT exact ! Due to transitions t0.t79, t1.t76, t2.t73, t4, t5, t7, t8, t10, t11, t12.t51, t13.t48, t16, t17, t19, t20, t22, ...412
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:11:33] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:11:33] [INFO ] Applying decomposition
[2022-05-19 15:11:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1790530429801627239.txt' '-o' '/tmp/graph1790530429801627239.bin' '-w' '/tmp/graph1790530429801627239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1790530429801627239.bin' '-l' '-1' '-v' '-w' '/tmp/graph1790530429801627239.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:11:33] [INFO ] Decomposing Gal with order
[2022-05-19 15:11:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:11:33] [INFO ] Removed a total of 14 redundant transitions.
[2022-05-19 15:11:33] [INFO ] Flatten gal took : 48 ms
[2022-05-19 15:11:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2022-05-19 15:11:33] [INFO ] Time to serialize gal into /tmp/LTL8486844505477312087.gal : 1 ms
[2022-05-19 15:11:33] [INFO ] Time to serialize properties into /tmp/LTL2164461852386489973.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8486844505477312087.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2164461852386489973.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8486844...245
Read 1 LTL properties
Checking formula 0 : !((G(F("((i7.u17.p93!=0)&&(i2.u1.p6!=1))"))))
Formula 0 simplified : !GF"((i7.u17.p93!=0)&&(i2.u1.p6!=1))"
Reverse transition relation is NOT exact ! Due to transitions t0_t79, t1_t76, t2_t73, t12_t51, t55_t60_t65_t67_t71_t74_t77_t68_t56, t14_t45_t82_t44, t100_t...581
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10694212402795557269
[2022-05-19 15:11:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10694212402795557269
Running compilation step : cd /tmp/ltsmin10694212402795557269;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 121 ms.
Running link step : cd /tmp/ltsmin10694212402795557269;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10694212402795557269;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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-002B-LTLCardinality-01 finished in 79294 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 114
Applied a total of 6 rules in 14 ms. Remains 124 /127 variables (removed 3) and now considering 114/117 (removed 3) transitions.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:12:03] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:12:03] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:12:03] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:04] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:04] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 114/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/127 places, 114/117 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s69 0) (EQ s61 1)), p1:(OR (EQ s61 0) (EQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-03 finished in 410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(G(F(X(p0)))))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 117/117 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 127 transition count 102
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 112 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 111 transition count 101
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 32 place count 111 transition count 91
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 52 place count 101 transition count 91
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 55 place count 98 transition count 88
Iterating global reduction 3 with 3 rules applied. Total rules applied 58 place count 98 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 98 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 97 transition count 87
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 124 place count 65 transition count 55
Applied a total of 124 rules in 25 ms. Remains 65 /127 variables (removed 62) and now considering 55/117 (removed 62) transitions.
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:04] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:04] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-19 15:12:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 55 rows 65 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:04] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/127 places, 55/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/127 places, 55/117 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-09 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:(AND (EQ s44 0) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 164 steps with 6 reset in 6 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-09 finished in 288 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!(X(p0)||p0) U p1)||G(F(G(p2)))))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 117/117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 126 transition count 103
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 113 transition count 103
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 26 place count 113 transition count 91
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 101 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 99 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 99 transition count 89
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 112 place count 70 transition count 60
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 68 transition count 58
Applied a total of 114 rules in 26 ms. Remains 68 /127 variables (removed 59) and now considering 58/117 (removed 59) transitions.
// Phase 1: matrix 58 rows 68 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:04] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 58 rows 68 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:04] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-19 15:12:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 58 rows 68 cols
[2022-05-19 15:12:04] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 68/127 places, 58/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/127 places, 58/117 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s41 0) (EQ s3 1)), p1:(OR (EQ s46 0) (EQ s22 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 952 reset in 206 ms.
Product exploration explored 100000 steps with 941 reset in 200 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 517 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=129 )
Knowledge obtained : [(AND p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 58/58 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 58/58 (removed 0) transitions.
// Phase 1: matrix 58 rows 68 cols
[2022-05-19 15:12:05] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:05] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 58 rows 68 cols
[2022-05-19 15:12:05] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:05] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-19 15:12:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 58 rows 68 cols
[2022-05-19 15:12:05] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-19 15:12:06] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/68 places, 58/58 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 713 steps, including 4 resets, run visited all 2 properties in 8 ms. (steps per millisecond=89 )
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 952 reset in 153 ms.
Product exploration explored 100000 steps with 941 reset in 274 ms.
Built C files in :
/tmp/ltsmin17711052895899199778
[2022-05-19 15:12:07] [INFO ] Computing symmetric may disable matrix : 58 transitions.
[2022-05-19 15:12:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:07] [INFO ] Computing symmetric may enable matrix : 58 transitions.
[2022-05-19 15:12:07] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:07] [INFO ] Computing Do-Not-Accords matrix : 58 transitions.
[2022-05-19 15:12:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17711052895899199778
Running compilation step : cd /tmp/ltsmin17711052895899199778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin17711052895899199778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17711052895899199778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18181394177890503808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 58/58 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 67 transition count 57
Applied a total of 2 rules in 8 ms. Remains 67 /68 variables (removed 1) and now considering 57/58 (removed 1) transitions.
// Phase 1: matrix 57 rows 67 cols
[2022-05-19 15:12:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:12:22] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 57 rows 67 cols
[2022-05-19 15:12:22] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:22] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2022-05-19 15:12:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 57 rows 67 cols
[2022-05-19 15:12:22] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:12:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/68 places, 57/58 transitions.
Finished structural reductions, in 1 iterations. Remains : 67/68 places, 57/58 transitions.
Built C files in :
/tmp/ltsmin7017432585679892328
[2022-05-19 15:12:22] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2022-05-19 15:12:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:22] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2022-05-19 15:12:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:22] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2022-05-19 15:12:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:12:22] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7017432585679892328
Running compilation step : cd /tmp/ltsmin7017432585679892328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 139 ms.
Running link step : cd /tmp/ltsmin7017432585679892328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7017432585679892328;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased396796651757226152.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:12:37] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:12:37] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:12:37] [INFO ] Time to serialize gal into /tmp/LTL15406334675906645113.gal : 1 ms
[2022-05-19 15:12:37] [INFO ] Time to serialize properties into /tmp/LTL5087250960211063509.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15406334675906645113.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5087250960211063509.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1540633...267
Read 1 LTL properties
Checking formula 0 : !((G(F(((!((X("(p52==1)"))||("(p52==1)")))U("((p90==0)||(p39==1))"))||(G(F(G("((p84==0)||(p7==1))"))))))))
Formula 0 simplified : !GF((!("(p52==1)" | X"(p52==1)") U "((p90==0)||(p39==1))") | GFG"((p84==0)||(p7==1))")
Reverse transition relation is NOT exact ! Due to transitions t0.t79, t1.t76, t2.t73, t3, t4, t5, t7, t8, t10, t11, t16, t17, t19, t20, t22, t24, t51, t64,...408
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:12:52] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:12:52] [INFO ] Applying decomposition
[2022-05-19 15:12:52] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16649025916494541128.txt' '-o' '/tmp/graph16649025916494541128.bin' '-w' '/tmp/graph16649025916494541128.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16649025916494541128.bin' '-l' '-1' '-v' '-w' '/tmp/graph16649025916494541128.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:12:52] [INFO ] Decomposing Gal with order
[2022-05-19 15:12:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:12:52] [INFO ] Removed a total of 13 redundant transitions.
[2022-05-19 15:12:52] [INFO ] Flatten gal took : 8 ms
[2022-05-19 15:12:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 2 ms.
[2022-05-19 15:12:52] [INFO ] Time to serialize gal into /tmp/LTL10839310859097326254.gal : 2 ms
[2022-05-19 15:12:52] [INFO ] Time to serialize properties into /tmp/LTL5067620286016715266.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10839310859097326254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5067620286016715266.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1083931...246
Read 1 LTL properties
Checking formula 0 : !((G(F(((!((X("(i2.u11.p52==1)"))||("(i2.u11.p52==1)")))U("((i4.u18.p90==0)||(i0.u9.p39==1))"))||(G(F(G("((i3.u15.p84==0)||(i1.i1.u1.p...170
Formula 0 simplified : !GF((!("(i2.u11.p52==1)" | X"(i2.u11.p52==1)") U "((i4.u18.p90==0)||(i0.u9.p39==1))") | GFG"((i3.u15.p84==0)||(i1.i1.u1.p7==1))")
Reverse transition relation is NOT exact ! Due to transitions t0_t79, t1_t76, t2_t73, t13_t48, t60_t65_t67_t71_t74_t77_t68_t61_t62, t46_t49, t14_t45_t82_t4...553
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5192489503662616247
[2022-05-19 15:13:07] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5192489503662616247
Running compilation step : cd /tmp/ltsmin5192489503662616247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 125 ms.
Running link step : cd /tmp/ltsmin5192489503662616247;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5192489503662616247;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(X((LTLAPp0==true))||(LTLAPp0==true)) U (LTLAPp1==true))||[](<>([]((LTLAPp2==true)))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-10 finished in 78260 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G(G(p0)))))'
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 117/117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 126 transition count 100
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 110 transition count 100
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 110 transition count 90
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 100 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 97 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 97 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 58 place count 97 transition count 86
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 96 transition count 86
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 122 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 63 transition count 53
Applied a total of 124 rules in 18 ms. Remains 63 /127 variables (removed 64) and now considering 53/117 (removed 64) transitions.
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:13:22] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:22] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:13:22] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-19 15:13:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 53 rows 63 cols
[2022-05-19 15:13:22] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:22] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/127 places, 53/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/127 places, 53/117 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s55 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 179 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-12 finished in 223 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))||F(X(p2))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 117/117 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 124 transition count 114
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 124 transition count 114
Applied a total of 6 rules in 7 ms. Remains 124 /127 variables (removed 3) and now considering 114/117 (removed 3) transitions.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:13:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:23] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:13:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:23] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
// Phase 1: matrix 114 rows 124 cols
[2022-05-19 15:13:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:23] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/127 places, 114/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 124/127 places, 114/117 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s100 0) (EQ s109 1)), p1:(OR (EQ s100 0) (EQ s109 1)), p2:(OR (EQ s90 0) (EQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 13 factoid took 192 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-13 finished in 893 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(X(p1)))||p0))))'
Support contains 4 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 117/117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 126 transition count 101
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 111 transition count 101
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 30 place count 111 transition count 92
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 48 place count 102 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 100 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 100 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 52 place count 100 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 99 transition count 89
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 112 place count 70 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 69 transition count 59
Applied a total of 113 rules in 19 ms. Remains 69 /127 variables (removed 58) and now considering 59/117 (removed 58) transitions.
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:23] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:23] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:24] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-19 15:13:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:24] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:24] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/127 places, 59/117 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/127 places, 59/117 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPs-PT-002B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s1 0) (EQ s5 1)), p0:(OR (EQ s57 0) (EQ s64 1))], nbAcceptance=2, 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 534 reset in 208 ms.
Product exploration explored 100000 steps with 528 reset in 234 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 5 factoid took 407 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 55 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :3
Finished Best-First random walk after 67 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 411 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:25] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:25] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:25] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:25] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-05-19 15:13:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:25] [INFO ] Computed 23 place invariants in 0 ms
[2022-05-19 15:13:25] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 59/59 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 268 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 595 steps, including 4 resets, run visited all 4 properties in 20 ms. (steps per millisecond=29 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 379 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 527 reset in 199 ms.
Product exploration explored 100000 steps with 533 reset in 338 ms.
Built C files in :
/tmp/ltsmin95381748679880287
[2022-05-19 15:13:27] [INFO ] Computing symmetric may disable matrix : 59 transitions.
[2022-05-19 15:13:27] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:27] [INFO ] Computing symmetric may enable matrix : 59 transitions.
[2022-05-19 15:13:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:27] [INFO ] Computing Do-Not-Accords matrix : 59 transitions.
[2022-05-19 15:13:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:27] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin95381748679880287
Running compilation step : cd /tmp/ltsmin95381748679880287;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 169 ms.
Running link step : cd /tmp/ltsmin95381748679880287;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin95381748679880287;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8944519101047246724.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:42] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-19 15:13:42] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:42] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-19 15:13:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2022-05-19 15:13:42] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 59 rows 69 cols
[2022-05-19 15:13:42] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-19 15:13:42] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 69/69 places, 59/59 transitions.
Built C files in :
/tmp/ltsmin17354859138408632283
[2022-05-19 15:13:42] [INFO ] Computing symmetric may disable matrix : 59 transitions.
[2022-05-19 15:13:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:42] [INFO ] Computing symmetric may enable matrix : 59 transitions.
[2022-05-19 15:13:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:42] [INFO ] Computing Do-Not-Accords matrix : 59 transitions.
[2022-05-19 15:13:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:13:42] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17354859138408632283
Running compilation step : cd /tmp/ltsmin17354859138408632283;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 148 ms.
Running link step : cd /tmp/ltsmin17354859138408632283;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin17354859138408632283;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17421091745235490689.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 15:13:57] [INFO ] Flatten gal took : 11 ms
[2022-05-19 15:13:57] [INFO ] Flatten gal took : 4 ms
[2022-05-19 15:13:57] [INFO ] Time to serialize gal into /tmp/LTL5054581167593372023.gal : 1 ms
[2022-05-19 15:13:57] [INFO ] Time to serialize properties into /tmp/LTL9729221567162228624.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5054581167593372023.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9729221567162228624.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5054581...266
Read 1 LTL properties
Checking formula 0 : !((F(G(((G(X(X("((p2==0)&&(p13==1))"))))||("(p114==0)"))||("(p125==1)")))))
Formula 0 simplified : !FG("(p114==0)" | "(p125==1)" | GXX"((p2==0)&&(p13==1))")
Reverse transition relation is NOT exact ! Due to transitions t0.t79, t1.t76, t2.t73, t4, t5, t7, t8, t10, t11, t12.t51, t13.t48, t16, t17, t19, t20, t22, ...433
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:14:12] [INFO ] Flatten gal took : 9 ms
[2022-05-19 15:14:12] [INFO ] Applying decomposition
[2022-05-19 15:14:12] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6155393145491423492.txt' '-o' '/tmp/graph6155393145491423492.bin' '-w' '/tmp/graph6155393145491423492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6155393145491423492.bin' '-l' '-1' '-v' '-w' '/tmp/graph6155393145491423492.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:14:12] [INFO ] Decomposing Gal with order
[2022-05-19 15:14:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:14:12] [INFO ] Removed a total of 13 redundant transitions.
[2022-05-19 15:14:12] [INFO ] Flatten gal took : 15 ms
[2022-05-19 15:14:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 2 ms.
[2022-05-19 15:14:12] [INFO ] Time to serialize gal into /tmp/LTL9838140440530918949.gal : 2 ms
[2022-05-19 15:14:12] [INFO ] Time to serialize properties into /tmp/LTL17542652991797256223.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9838140440530918949.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17542652991797256223.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9838140...246
Read 1 LTL properties
Checking formula 0 : !((F(G(((G(X(X("((i2.u0.p2==0)&&(i3.u1.p13==1))"))))||("(i4.u20.p114==0)"))||("(i5.u21.p125==1)")))))
Formula 0 simplified : !FG("(i4.u20.p114==0)" | "(i5.u21.p125==1)" | GXX"((i2.u0.p2==0)&&(i3.u1.p13==1))")
Reverse transition relation is NOT exact ! Due to transitions t0_t79, t1_t76, t2_t73, t12_t51, t13_t48, t107_t3, t14_t45_t82_t44, t36_t39_t43_t46_t49_t82_t...599
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18011889532166287337
[2022-05-19 15:14:27] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18011889532166287337
Running compilation step : cd /tmp/ltsmin18011889532166287337;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 137 ms.
Running link step : cd /tmp/ltsmin18011889532166287337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin18011889532166287337;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](([](X(X((LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-002B-LTLCardinality-15 finished in 78862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!(X(p0)||p0) U p1)||G(F(G(p2)))))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(X(X(p1)))||p0))))'
[2022-05-19 15:14:43] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9244213496315835928
[2022-05-19 15:14:43] [INFO ] Computing symmetric may disable matrix : 117 transitions.
[2022-05-19 15:14:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:43] [INFO ] Computing symmetric may enable matrix : 117 transitions.
[2022-05-19 15:14:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:43] [INFO ] Applying decomposition
[2022-05-19 15:14:43] [INFO ] Computing Do-Not-Accords matrix : 117 transitions.
[2022-05-19 15:14:43] [INFO ] Flatten gal took : 5 ms
[2022-05-19 15:14:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 15:14:43] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9244213496315835928
Running compilation step : cd /tmp/ltsmin9244213496315835928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1826153574960852013.txt' '-o' '/tmp/graph1826153574960852013.bin' '-w' '/tmp/graph1826153574960852013.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1826153574960852013.bin' '-l' '-1' '-v' '-w' '/tmp/graph1826153574960852013.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:14:43] [INFO ] Decomposing Gal with order
[2022-05-19 15:14:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:14:43] [INFO ] Removed a total of 18 redundant transitions.
[2022-05-19 15:14:43] [INFO ] Flatten gal took : 10 ms
[2022-05-19 15:14:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-19 15:14:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality16949014882761023351.gal : 2 ms
[2022-05-19 15:14:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality15278464666735754836.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16949014882761023351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15278464666735754836.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...269
Read 3 LTL properties
Checking formula 0 : !((G(F("((i8.i0.u36.p93!=0)&&(i3.u2.p6!=1))"))))
Formula 0 simplified : !GF"((i8.i0.u36.p93!=0)&&(i3.u2.p6!=1))"
Compilation finished in 224 ms.
Running link step : cd /tmp/ltsmin9244213496315835928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9244213496315835928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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 t43, t46, t49, t71, t74, t77, i0.i0.u6.t80, i1.i0.u13.t73, i1.i1.t62, i1.i1.u21.t64, i1.i1.u2...696
Computing Next relation with stutter on 162 deadlock states
LTSmin run took 243687 ms.
FORMULA ShieldPPPs-PT-002B-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin9244213496315835928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(X((LTLAPp1==true))||(LTLAPp1==true)) U (LTLAPp2==true))||[](<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: LTL layer: formula: [](<>(((!(X((LTLAPp1==true))||(LTLAPp1==true)) U (LTLAPp2==true))||[](<>([]((LTLAPp3==true)))))))
pins2lts-mc-linux64( 1/ 8), 0.002: "[](<>(((!(X((LTLAPp1==true))||(LTLAPp1==true)) U (LTLAPp2==true))||[](<>([]((LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: There are 124 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.027: State length is 128, there are 123 groups
pins2lts-mc-linux64( 0/ 8), 0.027: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.027: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.027: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.027: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.072: [Blue] ~107 levels ~960 states ~4712 transitions
pins2lts-mc-linux64( 0/ 8), 0.081: [Blue] ~170 levels ~1920 states ~6992 transitions
pins2lts-mc-linux64( 0/ 8), 0.102: [Blue] ~210 levels ~3840 states ~10080 transitions
pins2lts-mc-linux64( 0/ 8), 0.139: [Blue] ~226 levels ~7680 states ~16464 transitions
pins2lts-mc-linux64( 0/ 8), 0.187: [Blue] ~226 levels ~15360 states ~33272 transitions
pins2lts-mc-linux64( 0/ 8), 0.304: [Blue] ~226 levels ~30720 states ~68960 transitions
pins2lts-mc-linux64( 2/ 8), 0.510: [Blue] ~257 levels ~61440 states ~157832 transitions
pins2lts-mc-linux64( 2/ 8), 0.877: [Blue] ~257 levels ~122880 states ~326888 transitions
pins2lts-mc-linux64( 6/ 8), 1.515: [Blue] ~244 levels ~245760 states ~681952 transitions
pins2lts-mc-linux64( 6/ 8), 3.403: [Blue] ~244 levels ~491520 states ~1474512 transitions
pins2lts-mc-linux64( 0/ 8), 8.451: [Blue] ~227 levels ~983040 states ~3007968 transitions
pins2lts-mc-linux64( 6/ 8), 16.431: [Blue] ~244 levels ~1966080 states ~6490704 transitions
pins2lts-mc-linux64( 2/ 8), 27.077: [Blue] ~258 levels ~3932160 states ~13424760 transitions
pins2lts-mc-linux64( 6/ 8), 40.639: [Blue] ~244 levels ~7864320 states ~28619368 transitions
pins2lts-mc-linux64( 6/ 8), 67.360: [Blue] ~244 levels ~15728640 states ~61824296 transitions
pins2lts-mc-linux64( 0/ 8), 121.178: [Blue] ~227 levels ~31457280 states ~118430696 transitions
pins2lts-mc-linux64( 0/ 8), 224.422: [Blue] ~227 levels ~62914560 states ~248989960 transitions
pins2lts-mc-linux64( 0/ 8), 403.466: [Blue] ~227 levels ~125829120 states ~539864560 transitions
pins2lts-mc-linux64( 6/ 8), 518.405: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 518.451:
pins2lts-mc-linux64( 0/ 8), 518.451: Explored 142519416 states 740904327 transitions, fanout: 5.199
pins2lts-mc-linux64( 0/ 8), 518.451: Total exploration time 518.410 sec (518.360 sec minimum, 518.387 sec on average)
pins2lts-mc-linux64( 0/ 8), 518.451: States per second: 274916, Transitions per second: 1429186
pins2lts-mc-linux64( 0/ 8), 518.451:
pins2lts-mc-linux64( 0/ 8), 518.451: State space has 134217322 states, 12636844 are accepting
pins2lts-mc-linux64( 0/ 8), 518.451: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 518.451: blue states: 142519416 (106.19%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 518.451: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 518.451: all-red states: 98996151 (73.76%), bogus 947 (0.00%)
pins2lts-mc-linux64( 0/ 8), 518.451:
pins2lts-mc-linux64( 0/ 8), 518.451: Total memory used for local state coloring: 86.8MB
pins2lts-mc-linux64( 0/ 8), 518.451:
pins2lts-mc-linux64( 0/ 8), 518.452: Queue width: 8B, total height: 5686536, memory: 43.38MB
pins2lts-mc-linux64( 0/ 8), 518.452: Tree memory: 1026.7MB, 8.0 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 518.452: Tree fill ratio (roots/leafs): 99.0%/1.0%
pins2lts-mc-linux64( 0/ 8), 518.452: Stored 118 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 518.452: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 518.452: Est. total memory use: 1070.0MB (~1067.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9244213496315835928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(X((LTLAPp1==true))||(LTLAPp1==true)) U (LTLAPp2==true))||[](<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9244213496315835928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(X((LTLAPp1==true))||(LTLAPp1==true)) U (LTLAPp2==true))||[](<>([]((LTLAPp3==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
265 unique states visited
265 strongly connected components in search stack
266 transitions explored
265 items max in DFS search stack
58752 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,587.542,2436252,1,0,3.69417e+06,596,1030,8.31116e+06,143,2611,1141437
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Checking formula 1 : !((G(F(((!((X("(i1.i1.u21.p52==1)"))||("(i1.i1.u21.p52==1)")))U("((i8.i0.u34.p90==0)||(i2.i1.u17.p39==1))"))||(G(F(G("((i6.i0.u31.p84=...186
Formula 1 simplified : !GF((!("(i1.i1.u21.p52==1)" | X"(i1.i1.u21.p52==1)") U "((i8.i0.u34.p90==0)||(i2.i1.u17.p39==1))") | GFG"((i6.i0.u31.p84==0)||(i0.i1...168
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:36:03] [INFO ] Applying decomposition
[2022-05-19 15:36:03] [INFO ] Flatten gal took : 8 ms
[2022-05-19 15:36:03] [INFO ] Decomposing Gal with order
[2022-05-19 15:36:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:36:03] [INFO ] Removed a total of 12 redundant transitions.
[2022-05-19 15:36:03] [INFO ] Flatten gal took : 9 ms
[2022-05-19 15:36:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 2 ms.
[2022-05-19 15:36:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality18270066891181678764.gal : 2 ms
[2022-05-19 15:36:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality8592906569378128283.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality18270066891181678764.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8592906569378128283.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...268
Read 2 LTL properties
Checking formula 0 : !((G(F(((!((X("(i0.i1.i0.u22.p52==1)"))||("(i0.i1.i0.u22.p52==1)")))U("((i1.i0.i0.i0.i0.i0.i1.u48.p90==0)||(i0.i1.i0.i0.i0.u20.p39==1)...238
Formula 0 simplified : !GF((!("(i0.i1.i0.u22.p52==1)" | X"(i0.i1.i0.u22.p52==1)") U "((i1.i0.i0.i0.i0.i0.i1.u48.p90==0)||(i0.i1.i0.i0.i0.u20.p39==1))") | G...220
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t81, i0.i1.u23.t9, i0.i1.u23.t10, i0.i1.u23.t11, i0.i1.u23.t56, i0.i1.i0.u22.t6, i0.i1....1029
Computing Next relation with stutter on 162 deadlock states
Detected timeout of ITS tools.
[2022-05-19 15:57:23] [INFO ] Flatten gal took : 7 ms
[2022-05-19 15:57:23] [INFO ] Input system was already deterministic with 117 transitions.
[2022-05-19 15:57:23] [INFO ] Transformed 127 places.
[2022-05-19 15:57:23] [INFO ] Transformed 117 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-19 15:57:23] [INFO ] Time to serialize gal into /tmp/LTLCardinality7057029019028440448.gal : 1 ms
[2022-05-19 15:57:23] [INFO ] Time to serialize properties into /tmp/LTLCardinality5284718298942408067.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7057029019028440448.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5284718298942408067.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...333
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(((!((X("(p52==1)"))||("(p52==1)")))U("((p90==0)||(p39==1))"))||(G(F(G("((p84==0)||(p7==1))"))))))))
Formula 0 simplified : !GF((!("(p52==1)" | X"(p52==1)") U "((p90==0)||(p39==1))") | GFG"((p84==0)||(p7==1))")
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t28, ...364
Computing Next relation with stutter on 162 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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-002B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-002B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025100379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-002B.tgz
mv ShieldPPPs-PT-002B execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;