About the Execution of ITS-Tools for ShieldRVs-PT-010A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6955.315 | 3600000.00 | 9478422.00 | 9357.70 | ?FFFTFT?F?FFFTTT | 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-165286025800787.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 ShieldRVs-PT-010A, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025800787
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 7.8K Apr 30 06:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 30 06:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 30 06:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 06:42 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.4K May 9 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:58 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 63K 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 ShieldRVs-PT-010A-LTLCardinality-00
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-01
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-02
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-03
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-04
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-05
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-06
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-07
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-08
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-09
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-10
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-11
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-12
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-13
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-14
FORMULA_NAME ShieldRVs-PT-010A-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653045352726
Running Version 202205111006
[2022-05-20 11:15:53] [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-20 11:15:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 11:15:54] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-05-20 11:15:54] [INFO ] Transformed 143 places.
[2022-05-20 11:15:54] [INFO ] Transformed 193 transitions.
[2022-05-20 11:15:54] [INFO ] Found NUPN structural information;
[2022-05-20 11:15:54] [INFO ] Parsed PT model containing 143 places and 193 transitions in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVs-PT-010A-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010A-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010A-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-010A-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:15:54] [INFO ] Computed 41 place invariants in 14 ms
[2022-05-20 11:15:54] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:15:54] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-20 11:15:54] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:15:54] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:15:54] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Support contains 30 out of 143 places after structural reductions.
[2022-05-20 11:15:54] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 11:15:54] [INFO ] Flatten gal took : 51 ms
FORMULA ShieldRVs-PT-010A-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 11:15:54] [INFO ] Flatten gal took : 23 ms
[2022-05-20 11:15:55] [INFO ] Input system was already deterministic with 193 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 322 ms. (steps per millisecond=31 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:15:55] [INFO ] Computed 41 place invariants in 7 ms
[2022-05-20 11:15:55] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA ShieldRVs-PT-010A-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 191
Applied a total of 2 rules in 33 ms. Remains 141 /143 variables (removed 2) and now considering 191/193 (removed 2) transitions.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:15:55] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:15:55] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:15:55] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:15:56] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-20 11:15:56] [INFO ] Redundant transitions in 52 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:15:56] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:15:56] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/143 places, 190/193 transitions.
Applied a total of 0 rules in 13 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/143 places, 190/193 transitions.
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s10 0) (NEQ s110 1)), p0:(EQ s74 0)], 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 800 reset in 426 ms.
Product exploration explored 100000 steps with 804 reset in 291 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1527 steps, including 10 resets, run visited all 2 properties in 11 ms. (steps per millisecond=138 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 235 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 p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 190/190 transitions.
Applied a total of 0 rules in 14 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:15:57] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:15:58] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:15:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:15:58] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2022-05-20 11:15:58] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:15:58] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 190/190 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 70 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Finished Best-First random walk after 499 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=499 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 249 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 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 798 reset in 225 ms.
Product exploration explored 100000 steps with 810 reset in 280 ms.
Built C files in :
/tmp/ltsmin15434134312835889418
[2022-05-20 11:15:59] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 11:15:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:15:59] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 11:15:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:15:59] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 11:15:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:15:59] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15434134312835889418
Running compilation step : cd /tmp/ltsmin15434134312835889418;'/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 456 ms.
Running link step : cd /tmp/ltsmin15434134312835889418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15434134312835889418;'/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/stateBased11811457678334737223.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 190/190 transitions.
Applied a total of 0 rules in 11 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:16:14] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:16:14] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:16:14] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:16:15] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-05-20 11:16:15] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:16:15] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:16:15] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin13692480157919765607
[2022-05-20 11:16:15] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 11:16:15] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:16:15] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 11:16:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:16:15] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 11:16:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:16:15] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13692480157919765607
Running compilation step : cd /tmp/ltsmin13692480157919765607;'/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 367 ms.
Running link step : cd /tmp/ltsmin13692480157919765607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13692480157919765607;'/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/stateBased1071944467292150816.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:16:30] [INFO ] Flatten gal took : 18 ms
[2022-05-20 11:16:30] [INFO ] Flatten gal took : 15 ms
[2022-05-20 11:16:30] [INFO ] Time to serialize gal into /tmp/LTL13042098120067266617.gal : 3 ms
[2022-05-20 11:16:30] [INFO ] Time to serialize properties into /tmp/LTL4240048224012804916.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/LTL13042098120067266617.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4240048224012804916.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/LTL1304209...267
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p75==0)")||(G("((p11==1)&&(p111==0))"))))))
Formula 0 simplified : !GF("(p75==0)" | G"((p11==1)&&(p111==0))")
Detected timeout of ITS tools.
[2022-05-20 11:16:45] [INFO ] Flatten gal took : 14 ms
[2022-05-20 11:16:45] [INFO ] Applying decomposition
[2022-05-20 11:16:45] [INFO ] Flatten gal took : 14 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/graph11989683621097288596.txt' '-o' '/tmp/graph11989683621097288596.bin' '-w' '/tmp/graph11989683621097288596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11989683621097288596.bin' '-l' '-1' '-v' '-w' '/tmp/graph11989683621097288596.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:16:45] [INFO ] Decomposing Gal with order
[2022-05-20 11:16:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:16:45] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 11:16:45] [INFO ] Flatten gal took : 74 ms
[2022-05-20 11:16:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 9 ms.
[2022-05-20 11:16:45] [INFO ] Time to serialize gal into /tmp/LTL8833247362482639410.gal : 2 ms
[2022-05-20 11:16:45] [INFO ] Time to serialize properties into /tmp/LTL4427221060483277933.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/LTL8833247362482639410.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4427221060483277933.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/LTL8833247...245
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i5.u21.p75==0)")||(G("((i0.u3.p11==1)&&(i7.u32.p111==0))"))))))
Formula 0 simplified : !GF("(i5.u21.p75==0)" | G"((i0.u3.p11==1)&&(i7.u32.p111==0))")
Reverse transition relation is NOT exact ! Due to transitions t67, t71, t76, t81, t85, t88, t93, t95, t103, t107, t111, t116, t119, t126, t130, t133, t137,...1080
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12601905476306734804
[2022-05-20 11:17:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12601905476306734804
Running compilation step : cd /tmp/ltsmin12601905476306734804;'/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 305 ms.
Running link step : cd /tmp/ltsmin12601905476306734804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12601905476306734804;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLCardinality-00 finished in 80117 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(G(p1)))&&X(X(F(X((X(p2)||p3)))))))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:15] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 11:17:16] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:16] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:17:16] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:16] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:17:16] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 301 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p1), true, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p3), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s70 0) (EQ s42 1)), p1:(EQ s1 1), p3:(EQ s1 0), p2:(OR (EQ s102 0) (EQ s125 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 112 steps with 1 reset in 1 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLCardinality-01 finished in 665 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:16] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:16] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:17:16] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:16] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:16] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s128 0) (EQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 15727 reset in 217 ms.
Product exploration explored 100000 steps with 15791 reset in 303 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 113 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 58 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), false]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 25 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:17:18] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:17:18] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:17:18] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 11:17:18] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2022-05-20 11:17:18] [INFO ] Redundant transitions in 39 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:17:18] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:17:18] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 12 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 139 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 61 ms :[(NOT p0), false]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 129 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 50 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), false]
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), false]
Product exploration explored 100000 steps with 24139 reset in 235 ms.
Product exploration explored 100000 steps with 24061 reset in 264 ms.
Built C files in :
/tmp/ltsmin6350101864365011169
[2022-05-20 11:17:19] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2022-05-20 11:17:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:19] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2022-05-20 11:17:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:19] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2022-05-20 11:17:19] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:19] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6350101864365011169
Running compilation step : cd /tmp/ltsmin6350101864365011169;'/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 352 ms.
Running link step : cd /tmp/ltsmin6350101864365011169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6350101864365011169;'/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/stateBased17018983475414318936.hoa' '--buchi-type=spotba'
LTSmin run took 132 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-010A-LTLCardinality-06 finished in 3470 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F(p0))))'
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:20] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:20] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:20] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:20] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1470 reset in 221 ms.
Product exploration explored 100000 steps with 1461 reset in 231 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 68 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=68 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:17:21] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:21] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 11:17:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 11:17:21] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-20 11:17:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 11:17:21] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:17:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 11:17:21] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-20 11:17:21] [INFO ] Computed and/alt/rep : 101/394/101 causal constraints (skipped 91 transitions) in 12 ms.
[2022-05-20 11:17:21] [INFO ] Added : 65 causal constraints over 13 iterations in 260 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 191
Applied a total of 2 rules in 8 ms. Remains 141 /143 variables (removed 2) and now considering 191/193 (removed 2) transitions.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:17:21] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:17:21] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:17:21] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:22] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2022-05-20 11:17:22] [INFO ] Redundant transitions in 58 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:17:22] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:17:22] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/143 places, 190/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/143 places, 190/193 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 63 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=63 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:17:22] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:22] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 11:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 11:17:22] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-20 11:17:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 11:17:22] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 11:17:22] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-20 11:17:22] [INFO ] Computed and/alt/rep : 172/723/172 causal constraints (skipped 17 transitions) in 13 ms.
[2022-05-20 11:17:23] [INFO ] Added : 124 causal constraints over 26 iterations in 530 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1501 reset in 208 ms.
Product exploration explored 100000 steps with 1519 reset in 222 ms.
Built C files in :
/tmp/ltsmin11972082000757916503
[2022-05-20 11:17:23] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 11:17:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:23] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 11:17:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:23] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 11:17:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:23] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11972082000757916503
Running compilation step : cd /tmp/ltsmin11972082000757916503;'/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 354 ms.
Running link step : cd /tmp/ltsmin11972082000757916503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11972082000757916503;'/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/stateBased6902079487152062356.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:17:39] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:17:39] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:17:39] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:17:39] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-20 11:17:39] [INFO ] Redundant transitions in 48 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:17:39] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:17:39] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin12156107526971441993
[2022-05-20 11:17:39] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 11:17:39] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:39] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 11:17:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:39] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 11:17:39] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:17:39] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12156107526971441993
Running compilation step : cd /tmp/ltsmin12156107526971441993;'/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 366 ms.
Running link step : cd /tmp/ltsmin12156107526971441993;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12156107526971441993;'/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/stateBased11055718867467024490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:17:54] [INFO ] Flatten gal took : 13 ms
[2022-05-20 11:17:54] [INFO ] Flatten gal took : 12 ms
[2022-05-20 11:17:54] [INFO ] Time to serialize gal into /tmp/LTL7668668556764387497.gal : 2 ms
[2022-05-20 11:17:54] [INFO ] Time to serialize properties into /tmp/LTL14870331500795548102.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/LTL7668668556764387497.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14870331500795548102.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/LTL7668668...267
Read 1 LTL properties
Checking formula 0 : !((X(("(p39==1)")U(F("(p39==1)")))))
Formula 0 simplified : !X("(p39==1)" U F"(p39==1)")
Detected timeout of ITS tools.
[2022-05-20 11:18:09] [INFO ] Flatten gal took : 11 ms
[2022-05-20 11:18:09] [INFO ] Applying decomposition
[2022-05-20 11:18:09] [INFO ] Flatten gal took : 12 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/graph4458066999993014789.txt' '-o' '/tmp/graph4458066999993014789.bin' '-w' '/tmp/graph4458066999993014789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4458066999993014789.bin' '-l' '-1' '-v' '-w' '/tmp/graph4458066999993014789.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:18:09] [INFO ] Decomposing Gal with order
[2022-05-20 11:18:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:18:09] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 11:18:09] [INFO ] Flatten gal took : 19 ms
[2022-05-20 11:18:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 4 ms.
[2022-05-20 11:18:09] [INFO ] Time to serialize gal into /tmp/LTL9620008257952506883.gal : 1 ms
[2022-05-20 11:18:09] [INFO ] Time to serialize properties into /tmp/LTL13597292520001728952.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/LTL9620008257952506883.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13597292520001728952.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/LTL9620008...246
Read 1 LTL properties
Checking formula 0 : !((X(("(i2.u11.p39==1)")U(F("(i2.u11.p39==1)")))))
Formula 0 simplified : !X("(i2.u11.p39==1)" U F"(i2.u11.p39==1)")
Reverse transition relation is NOT exact ! Due to transitions t67, t71, t76, t81, t85, t88, t93, t95, t103, t107, t111, t116, t119, t126, t130, t133, t137,...1080
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10955392821188774527
[2022-05-20 11:18:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10955392821188774527
Running compilation step : cd /tmp/ltsmin10955392821188774527;'/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 304 ms.
Running link step : cd /tmp/ltsmin10955392821188774527;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10955392821188774527;'/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) U <>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLCardinality-07 finished in 79813 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(G((p0 U p1)))))'
Support contains 4 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:18:39] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:18:39] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:18:39] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:18:40] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:18:40] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:18:40] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=2, aps=[p0:(OR (EQ s138 0) (EQ s94 1)), p1:(OR (EQ s142 0) (EQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLCardinality-08 finished in 580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:18:40] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:18:40] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:18:40] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:18:40] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:18:40] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:18:40] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (EQ s138 0) (EQ s60 1)), p1:(OR (EQ s138 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 687 reset in 317 ms.
Product exploration explored 100000 steps with 685 reset in 262 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), false]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p0 p1), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 192
Applied a total of 2 rules in 12 ms. Remains 142 /143 variables (removed 1) and now considering 192/193 (removed 1) transitions.
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:18:41] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:18:42] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 192 rows 142 cols
[2022-05-20 11:18:42] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:18:42] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2022-05-20 11:18:42] [INFO ] Redundant transitions in 33 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:18:42] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:18:42] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/143 places, 191/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 142/143 places, 191/193 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, (X (NOT p1)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p1)]
Product exploration explored 100000 steps with 698 reset in 230 ms.
Product exploration explored 100000 steps with 699 reset in 252 ms.
Built C files in :
/tmp/ltsmin6600485925684934256
[2022-05-20 11:18:43] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2022-05-20 11:18:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:18:43] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2022-05-20 11:18:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:18:43] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2022-05-20 11:18:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:18:43] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6600485925684934256
Running compilation step : cd /tmp/ltsmin6600485925684934256;'/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 362 ms.
Running link step : cd /tmp/ltsmin6600485925684934256;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin6600485925684934256;'/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/stateBased14661254015550602651.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 142 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 142/142 places, 191/191 transitions.
Applied a total of 0 rules in 13 ms. Remains 142 /142 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:18:58] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:18:58] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:18:58] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:18:58] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2022-05-20 11:18:58] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 191 rows 142 cols
[2022-05-20 11:18:58] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:18:58] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 142/142 places, 191/191 transitions.
Built C files in :
/tmp/ltsmin18394054562097145022
[2022-05-20 11:18:58] [INFO ] Computing symmetric may disable matrix : 191 transitions.
[2022-05-20 11:18:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:18:58] [INFO ] Computing symmetric may enable matrix : 191 transitions.
[2022-05-20 11:18:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:18:58] [INFO ] Computing Do-Not-Accords matrix : 191 transitions.
[2022-05-20 11:18:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:18:58] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18394054562097145022
Running compilation step : cd /tmp/ltsmin18394054562097145022;'/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 372 ms.
Running link step : cd /tmp/ltsmin18394054562097145022;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin18394054562097145022;'/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/stateBased4939365935586806789.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:19:13] [INFO ] Flatten gal took : 12 ms
[2022-05-20 11:19:13] [INFO ] Flatten gal took : 11 ms
[2022-05-20 11:19:13] [INFO ] Time to serialize gal into /tmp/LTL12256936906283581452.gal : 2 ms
[2022-05-20 11:19:13] [INFO ] Time to serialize properties into /tmp/LTL4408632561198610605.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/LTL12256936906283581452.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4408632561198610605.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/LTL1225693...267
Read 1 LTL properties
Checking formula 0 : !((X(((F(G("((p138==0)||(p60==1))")))||("(p138==0)"))||("(p60==1)"))))
Formula 0 simplified : !X("(p60==1)" | "(p138==0)" | FG"((p138==0)||(p60==1))")
Detected timeout of ITS tools.
[2022-05-20 11:19:28] [INFO ] Flatten gal took : 17 ms
[2022-05-20 11:19:28] [INFO ] Applying decomposition
[2022-05-20 11:19:28] [INFO ] Flatten gal took : 11 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/graph7097640077824806658.txt' '-o' '/tmp/graph7097640077824806658.bin' '-w' '/tmp/graph7097640077824806658.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7097640077824806658.bin' '-l' '-1' '-v' '-w' '/tmp/graph7097640077824806658.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:19:28] [INFO ] Decomposing Gal with order
[2022-05-20 11:19:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:19:28] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 11:19:28] [INFO ] Flatten gal took : 17 ms
[2022-05-20 11:19:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 5 ms.
[2022-05-20 11:19:28] [INFO ] Time to serialize gal into /tmp/LTL5172801087463749999.gal : 2 ms
[2022-05-20 11:19:28] [INFO ] Time to serialize properties into /tmp/LTL9432929222199367504.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/LTL5172801087463749999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9432929222199367504.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/LTL5172801...245
Read 1 LTL properties
Checking formula 0 : !((X(((F(G("((i9.u39.p138==0)||(i4.u17.p60==1))")))||("(i9.u39.p138==0)"))||("(i4.u17.p60==1)"))))
Formula 0 simplified : !X("(i4.u17.p60==1)" | "(i9.u39.p138==0)" | FG"((i9.u39.p138==0)||(i4.u17.p60==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7743584650591318631
[2022-05-20 11:19:44] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7743584650591318631
Running compilation step : cd /tmp/ltsmin7743584650591318631;'/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 298 ms.
Running link step : cd /tmp/ltsmin7743584650591318631;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7743584650591318631;'/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)))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLCardinality-09 finished in 78697 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 1 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:19:59] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 11:19:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 6 ms
[2022-05-20 11:19:59] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 193/193 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s84 0) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLCardinality-11 finished in 443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 191
Applied a total of 2 rules in 14 ms. Remains 141 /143 variables (removed 2) and now considering 191/193 (removed 2) transitions.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 11:19:59] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:19:59] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2022-05-20 11:19:59] [INFO ] Redundant transitions in 35 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:19:59] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/143 places, 190/193 transitions.
Applied a total of 0 rules in 3 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/143 places, 190/193 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3269 steps with 42 reset in 15 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-010A-LTLCardinality-12 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(X(G(p0)))||p1)&&p2)))'
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Applied a total of 0 rules in 7 ms. Remains 143 /143 variables (removed 0) and now considering 193/193 (removed 0) transitions.
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:19:59] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:00] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 193 rows 143 cols
[2022-05-20 11:20:00] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:00] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2022-05-20 11:20:00] [INFO ] Redundant transitions in 38 ms returned [63]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:20:00] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:00] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/143 places, 192/193 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 143/143 places, 192/193 transitions.
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p1) p0)), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s81 0) (EQ s120 1)), p1:(EQ s132 1), p0:(AND (EQ s112 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Product exploration explored 100000 steps with 50000 reset in 349 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p2), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 391 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 1317 steps, including 8 resets, run visited all 5 properties in 14 ms. (steps per millisecond=94 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X p2), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p1) p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p2 (NOT p1)))), (F (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 560 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:20:02] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:02] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 11:20:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:02] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-20 11:20:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 11:20:02] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:20:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:02] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-20 11:20:02] [INFO ] Computed and/alt/rep : 102/408/102 causal constraints (skipped 89 transitions) in 13 ms.
[2022-05-20 11:20:02] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 3 ms to minimize.
[2022-05-20 11:20:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-05-20 11:20:03] [INFO ] Added : 69 causal constraints over 15 iterations in 379 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 192/192 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:20:03] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:20:03] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:20:03] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:20:03] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2022-05-20 11:20:03] [INFO ] Redundant transitions in 52 ms returned []
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:20:03] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:20:03] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 192/192 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 374 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Finished random walk after 1022 steps, including 6 resets, run visited all 5 properties in 4 ms. (steps per millisecond=255 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (X (NOT (AND p2 (NOT p1)))), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 11 factoid took 506 ms. Reduced automaton from 2 states, 5 edges and 3 AP to 2 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Stuttering acceptance computed with spot in 75 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
// Phase 1: matrix 192 rows 143 cols
[2022-05-20 11:20:04] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:04] [INFO ] [Real]Absence check using 41 positive place invariants in 8 ms returned sat
[2022-05-20 11:20:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:04] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2022-05-20 11:20:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 11:20:04] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:04] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-20 11:20:04] [INFO ] Computed and/alt/rep : 102/408/102 causal constraints (skipped 89 transitions) in 12 ms.
[2022-05-20 11:20:05] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2022-05-20 11:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2022-05-20 11:20:05] [INFO ] Added : 69 causal constraints over 15 iterations in 392 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Built C files in :
/tmp/ltsmin6542801575588255692
[2022-05-20 11:20:06] [INFO ] Computing symmetric may disable matrix : 192 transitions.
[2022-05-20 11:20:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:06] [INFO ] Computing symmetric may enable matrix : 192 transitions.
[2022-05-20 11:20:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:06] [INFO ] Computing Do-Not-Accords matrix : 192 transitions.
[2022-05-20 11:20:06] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:06] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6542801575588255692
Running compilation step : cd /tmp/ltsmin6542801575588255692;'/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 369 ms.
Running link step : cd /tmp/ltsmin6542801575588255692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6542801575588255692;'/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/stateBased11275974483986946826.hoa' '--buchi-type=spotba'
LTSmin run took 325 ms.
FORMULA ShieldRVs-PT-010A-LTLCardinality-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVs-PT-010A-LTLCardinality-15 finished in 6862 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U F(p0))))'
Found a CL insensitive property : ShieldRVs-PT-010A-LTLCardinality-07
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 143/143 places, 193/193 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 141 transition count 191
Applied a total of 2 rules in 11 ms. Remains 141 /143 variables (removed 2) and now considering 191/193 (removed 2) transitions.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:20:07] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:20:07] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:20:07] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:07] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:20:07] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:20:07] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 141/143 places, 191/193 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/143 places, 191/193 transitions.
Running random walk in product with property : ShieldRVs-PT-010A-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1515 reset in 208 ms.
Product exploration explored 100000 steps with 1513 reset in 227 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:20:08] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:08] [INFO ] [Real]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:08] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-20 11:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 11:20:08] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:08] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-20 11:20:08] [INFO ] Computed and/alt/rep : 172/722/172 causal constraints (skipped 18 transitions) in 13 ms.
[2022-05-20 11:20:09] [INFO ] Added : 136 causal constraints over 29 iterations in 592 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 191/191 transitions.
Applied a total of 0 rules in 6 ms. Remains 141 /141 variables (removed 0) and now considering 191/191 (removed 0) transitions.
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:20:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:09] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 191 rows 141 cols
[2022-05-20 11:20:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:09] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2022-05-20 11:20:09] [INFO ] Redundant transitions in 36 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:20:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:09] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/141 places, 190/191 transitions.
Applied a total of 0 rules in 4 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 141/141 places, 190/191 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:20:09] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:09] [INFO ] [Real]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 11:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:10] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-20 11:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 11:20:10] [INFO ] [Nat]Absence check using 41 positive place invariants in 6 ms returned sat
[2022-05-20 11:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 11:20:10] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-20 11:20:10] [INFO ] Computed and/alt/rep : 172/723/172 causal constraints (skipped 17 transitions) in 17 ms.
[2022-05-20 11:20:10] [INFO ] Added : 124 causal constraints over 26 iterations in 480 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1514 reset in 215 ms.
Product exploration explored 100000 steps with 1498 reset in 224 ms.
Built C files in :
/tmp/ltsmin6965494983559063746
[2022-05-20 11:20:11] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 11:20:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:11] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 11:20:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:11] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 11:20:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:11] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6965494983559063746
Running compilation step : cd /tmp/ltsmin6965494983559063746;'/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 355 ms.
Running link step : cd /tmp/ltsmin6965494983559063746;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6965494983559063746;'/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/stateBased16923681829566686626.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 190/190 transitions.
Applied a total of 0 rules in 8 ms. Remains 141 /141 variables (removed 0) and now considering 190/190 (removed 0) transitions.
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:20:26] [INFO ] Computed 41 place invariants in 0 ms
[2022-05-20 11:20:26] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:20:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:26] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2022-05-20 11:20:26] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 190 rows 141 cols
[2022-05-20 11:20:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 11:20:26] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 141/141 places, 190/190 transitions.
Built C files in :
/tmp/ltsmin9730694873525061038
[2022-05-20 11:20:26] [INFO ] Computing symmetric may disable matrix : 190 transitions.
[2022-05-20 11:20:26] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:26] [INFO ] Computing symmetric may enable matrix : 190 transitions.
[2022-05-20 11:20:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:26] [INFO ] Computing Do-Not-Accords matrix : 190 transitions.
[2022-05-20 11:20:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:20:26] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9730694873525061038
Running compilation step : cd /tmp/ltsmin9730694873525061038;'/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 351 ms.
Running link step : cd /tmp/ltsmin9730694873525061038;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9730694873525061038;'/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/stateBased17067451280838118829.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-20 11:20:41] [INFO ] Flatten gal took : 11 ms
[2022-05-20 11:20:41] [INFO ] Flatten gal took : 10 ms
[2022-05-20 11:20:41] [INFO ] Time to serialize gal into /tmp/LTL6676374368047978458.gal : 2 ms
[2022-05-20 11:20:41] [INFO ] Time to serialize properties into /tmp/LTL14355980815799192423.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/LTL6676374368047978458.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14355980815799192423.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/LTL6676374...267
Read 1 LTL properties
Checking formula 0 : !((X(("(p39==1)")U(F("(p39==1)")))))
Formula 0 simplified : !X("(p39==1)" U F"(p39==1)")
Detected timeout of ITS tools.
[2022-05-20 11:20:56] [INFO ] Flatten gal took : 9 ms
[2022-05-20 11:20:56] [INFO ] Applying decomposition
[2022-05-20 11:20:56] [INFO ] Flatten gal took : 9 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/graph17699195654211467489.txt' '-o' '/tmp/graph17699195654211467489.bin' '-w' '/tmp/graph17699195654211467489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17699195654211467489.bin' '-l' '-1' '-v' '-w' '/tmp/graph17699195654211467489.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:20:56] [INFO ] Decomposing Gal with order
[2022-05-20 11:20:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:20:56] [INFO ] Removed a total of 205 redundant transitions.
[2022-05-20 11:20:56] [INFO ] Flatten gal took : 16 ms
[2022-05-20 11:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 188 labels/synchronizations in 4 ms.
[2022-05-20 11:20:56] [INFO ] Time to serialize gal into /tmp/LTL15508488683041007894.gal : 2 ms
[2022-05-20 11:20:56] [INFO ] Time to serialize properties into /tmp/LTL11360142382792635143.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/LTL15508488683041007894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11360142382792635143.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/LTL1550848...247
Read 1 LTL properties
Checking formula 0 : !((X(("(i2.u11.p39==1)")U(F("(i2.u11.p39==1)")))))
Formula 0 simplified : !X("(i2.u11.p39==1)" U F"(i2.u11.p39==1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14564879414235622920
[2022-05-20 11:21:11] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14564879414235622920
Running compilation step : cd /tmp/ltsmin14564879414235622920;'/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 327 ms.
Running link step : cd /tmp/ltsmin14564879414235622920;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14564879414235622920;'/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) U <>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVs-PT-010A-LTLCardinality-07 finished in 79994 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p1))||p0)))'
[2022-05-20 11:21:27] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14505512394459151968
[2022-05-20 11:21:27] [INFO ] Computing symmetric may disable matrix : 193 transitions.
[2022-05-20 11:21:27] [INFO ] Applying decomposition
[2022-05-20 11:21:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:21:27] [INFO ] Computing symmetric may enable matrix : 193 transitions.
[2022-05-20 11:21:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:21:27] [INFO ] Computing Do-Not-Accords matrix : 193 transitions.
[2022-05-20 11:21:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 11:21:27] [INFO ] Flatten gal took : 9 ms
[2022-05-20 11:21:27] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14505512394459151968
Running compilation step : cd /tmp/ltsmin14505512394459151968;'/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/graph8637385891355464862.txt' '-o' '/tmp/graph8637385891355464862.bin' '-w' '/tmp/graph8637385891355464862.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8637385891355464862.bin' '-l' '-1' '-v' '-w' '/tmp/graph8637385891355464862.weights' '-q' '0' '-e' '0.001'
[2022-05-20 11:21:27] [INFO ] Decomposing Gal with order
[2022-05-20 11:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:21:27] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 11:21:27] [INFO ] Flatten gal took : 15 ms
[2022-05-20 11:21:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 192 labels/synchronizations in 5 ms.
[2022-05-20 11:21:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality4322440761822789595.gal : 2 ms
[2022-05-20 11:21:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality8587600085684783241.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/LTLCardinality4322440761822789595.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8587600085684783241.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...267
Read 3 LTL properties
Checking formula 0 : !((G(F(("(i5.u21.p75==0)")||(G("((i0.u3.p11!=0)&&(i7.u32.p111!=1))"))))))
Formula 0 simplified : !GF("(i5.u21.p75==0)" | G"((i0.u3.p11!=0)&&(i7.u32.p111!=1))")
Compilation finished in 422 ms.
Running link step : cd /tmp/ltsmin14505512394459151968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14505512394459151968;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t67, t71, t76, t81, t85, t88, t93, t95, t103, t107, t111, t116, t119, t126, t130, t133, t137,...1076
Computing Next relation with stutter on 1.50469e+07 deadlock states
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin14505512394459151968;'/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)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14505512394459151968;'/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(((LTLAPp2==true) U <>((LTLAPp2==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 11:43:18] [INFO ] Applying decomposition
[2022-05-20 11:43:18] [INFO ] Flatten gal took : 20 ms
[2022-05-20 11:43:18] [INFO ] Decomposing Gal with order
[2022-05-20 11:43:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 11:43:18] [INFO ] Removed a total of 207 redundant transitions.
[2022-05-20 11:43:18] [INFO ] Flatten gal took : 46 ms
[2022-05-20 11:43:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 120 labels/synchronizations in 19 ms.
[2022-05-20 11:43:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality14591435485948771750.gal : 2 ms
[2022-05-20 11:43:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality8678340173698751526.ltl : 8 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/LTLCardinality14591435485948771750.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8678340173698751526.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 3 LTL properties
Checking formula 0 : !((G(F(("(u22.p75==0)")||(G("((u4.p11!=0)&&(u33.p111!=1))"))))))
Formula 0 simplified : !GF("(u22.p75==0)" | G"((u4.p11!=0)&&(u33.p111!=1))")
Reverse transition relation is NOT exact ! Due to transitions t64, t69, t71, t76, t78, t84, t86, t90, t96, t102, t103, t109, t114, t118, t120, t124, t130, ...859
Computing Next relation with stutter on 1.50469e+07 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: LTL layer: formula: X(((LTLAPp2==true) U <>((LTLAPp2==true))))
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: "X(((LTLAPp2==true) U <>((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.017: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.071: DFS-FIFO for weak LTL, using special progress label 199
pins2lts-mc-linux64( 0/ 8), 0.071: There are 200 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.071: State length is 144, there are 195 groups
pins2lts-mc-linux64( 0/ 8), 0.071: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.071: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.071: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.071: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.112: ~93 levels ~960 states ~4632 transitions
pins2lts-mc-linux64( 1/ 8), 0.121: ~94 levels ~1920 states ~6288 transitions
pins2lts-mc-linux64( 1/ 8), 0.128: ~94 levels ~3840 states ~10480 transitions
pins2lts-mc-linux64( 1/ 8), 0.167: ~95 levels ~7680 states ~19664 transitions
pins2lts-mc-linux64( 1/ 8), 0.219: ~95 levels ~15360 states ~39408 transitions
pins2lts-mc-linux64( 6/ 8), 0.348: ~116 levels ~30720 states ~73264 transitions
pins2lts-mc-linux64( 7/ 8), 0.588: ~101 levels ~61440 states ~168096 transitions
pins2lts-mc-linux64( 0/ 8), 1.010: ~103 levels ~122880 states ~345408 transitions
pins2lts-mc-linux64( 1/ 8), 1.779: ~119 levels ~245760 states ~695536 transitions
pins2lts-mc-linux64( 0/ 8), 3.022: ~104 levels ~491520 states ~1499224 transitions
pins2lts-mc-linux64( 0/ 8), 5.085: ~104 levels ~983040 states ~3149544 transitions
pins2lts-mc-linux64( 0/ 8), 8.692: ~106 levels ~1966080 states ~6504280 transitions
pins2lts-mc-linux64( 6/ 8), 15.515: ~140 levels ~3932160 states ~13018944 transitions
pins2lts-mc-linux64( 6/ 8), 30.125: ~140 levels ~7864320 states ~27942600 transitions
pins2lts-mc-linux64( 6/ 8), 60.076: ~140 levels ~15728640 states ~59296736 transitions
pins2lts-mc-linux64( 0/ 8), 119.568: ~107 levels ~31457280 states ~120158864 transitions
pins2lts-mc-linux64( 0/ 8), 241.904: ~107 levels ~62914560 states ~247224880 transitions
pins2lts-mc-linux64( 6/ 8), 500.229: ~155 levels ~125829120 states ~521000440 transitions
pins2lts-mc-linux64( 0/ 8), 571.385: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 571.421:
pins2lts-mc-linux64( 0/ 8), 571.421: mean standard work distribution: 2.4% (states) 2.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 571.421:
pins2lts-mc-linux64( 0/ 8), 571.421: Explored 134213587 states 591089198 transitions, fanout: 4.404
pins2lts-mc-linux64( 0/ 8), 571.421: Total exploration time 571.330 sec (571.290 sec minimum, 571.312 sec on average)
pins2lts-mc-linux64( 0/ 8), 571.421: States per second: 234914, Transitions per second: 1034585
pins2lts-mc-linux64( 0/ 8), 571.421:
pins2lts-mc-linux64( 0/ 8), 571.421: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 571.421: Redundant explorations: -0.0027
pins2lts-mc-linux64( 0/ 8), 571.421:
pins2lts-mc-linux64( 0/ 8), 571.421: Queue width: 8B, total height: 1043, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 571.421: Tree memory: 1031.7MB, 8.1 B/state, compr.: 1.4%
pins2lts-mc-linux64( 0/ 8), 571.421: Tree fill ratio (roots/leafs): 99.0%/3.0%
pins2lts-mc-linux64( 0/ 8), 571.421: Stored 193 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 571.421: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 571.421: Est. total memory use: 1031.7MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14505512394459151968;'/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(((LTLAPp2==true) U <>((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14505512394459151968;'/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(((LTLAPp2==true) U <>((LTLAPp2==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)
Detected timeout of ITS tools.
[2022-05-20 12:05:09] [INFO ] Flatten gal took : 9 ms
[2022-05-20 12:05:09] [INFO ] Input system was already deterministic with 193 transitions.
[2022-05-20 12:05:09] [INFO ] Transformed 143 places.
[2022-05-20 12:05:09] [INFO ] Transformed 193 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-20 12:05:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality9687810886888237616.gal : 1 ms
[2022-05-20 12:05:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality15188172984468782956.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/LTLCardinality9687810886888237616.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15188172984468782956.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...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(p75==0)")||(G("((p11!=0)&&(p111!=1))"))))))
Formula 0 simplified : !GF("(p75==0)" | G"((p11!=0)&&(p111!=1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...969
Computing Next relation with stutter on 1.50469e+07 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="ShieldRVs-PT-010A"
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 ShieldRVs-PT-010A, 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-165286025800787"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-010A.tgz
mv ShieldRVs-PT-010A 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 ;