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-165286025600692.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 ShieldPPPt-PT-100A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025600692
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 7.0K Apr 29 13:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 13:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 13:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 13:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:56 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 685K 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 ShieldPPPt-PT-100A-LTLFireability-00
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-01
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-02
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-03
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-04
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-05
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-06
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-07
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-08
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-09
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-10
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-11
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-12
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-13
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-14
FORMULA_NAME ShieldPPPt-PT-100A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653035571668

Running Version 202205111006
[2022-05-20 08:32:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 08:32:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 08:32:53] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-05-20 08:32:53] [INFO ] Transformed 2503 places.
[2022-05-20 08:32:53] [INFO ] Transformed 1803 transitions.
[2022-05-20 08:32:53] [INFO ] Found NUPN structural information;
[2022-05-20 08:32:53] [INFO ] Parsed PT model containing 2503 places and 1803 transitions in 407 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldPPPt-PT-100A-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 245 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:32:53] [INFO ] Computed 1101 place invariants in 34 ms
[2022-05-20 08:32:55] [INFO ] Implicit Places using invariants in 1490 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:32:55] [INFO ] Computed 1101 place invariants in 15 ms
[2022-05-20 08:32:57] [INFO ] Implicit Places using invariants and state equation in 1883 ms returned []
Implicit Place search using SMT with State Equation took 3411 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:32:57] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:32:58] [INFO ] Dead Transitions using invariants and state equation in 1028 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Support contains 58 out of 2503 places after structural reductions.
[2022-05-20 08:32:58] [INFO ] Flatten gal took : 312 ms
[2022-05-20 08:32:58] [INFO ] Flatten gal took : 243 ms
[2022-05-20 08:32:59] [INFO ] Input system was already deterministic with 1802 transitions.
Support contains 56 out of 2503 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 691 ms. (steps per millisecond=14 ) properties (out of 34) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:33:00] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:33:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 198 ms returned sat
[2022-05-20 08:33:02] [INFO ] After 2587ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2022-05-20 08:33:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 219 ms returned sat
[2022-05-20 08:33:26] [INFO ] After 20271ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2022-05-20 08:33:27] [INFO ] After 22089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 2 ms.
[2022-05-20 08:33:27] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Fused 30 Parikh solutions to 27 different solutions.
Parikh walk visited 21 properties in 10592 ms.
Support contains 18 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 393 times.
Drop transitions removed 393 transitions
Iterating global reduction 0 with 393 rules applied. Total rules applied 397 place count 2501 transition count 1800
Applied a total of 397 rules in 724 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 58233 steps, run timeout after 3004 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 58233 steps, saw 55202 distinct states, run finished after 3006 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:33:43] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 08:33:44] [INFO ] [Real]Absence check using 1101 positive place invariants in 201 ms returned sat
[2022-05-20 08:33:46] [INFO ] After 1227ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2022-05-20 08:33:46] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:33:46] [INFO ] After 125ms SMT Verify possible using 102 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 08:33:46] [INFO ] After 2318ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 08:33:47] [INFO ] [Nat]Absence check using 1101 positive place invariants in 190 ms returned sat
[2022-05-20 08:33:51] [INFO ] After 3901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 08:33:57] [INFO ] After 5946ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-20 08:33:58] [INFO ] Deduced a trap composed of 6 places in 247 ms of which 7 ms to minimize.
[2022-05-20 08:33:59] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 2 ms to minimize.
[2022-05-20 08:33:59] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 1 ms to minimize.
[2022-05-20 08:33:59] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2022-05-20 08:33:59] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-05-20 08:34:00] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 08:34:00] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 1 ms to minimize.
[2022-05-20 08:34:00] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-20 08:34:00] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2022-05-20 08:34:00] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2022-05-20 08:34:00] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2333 ms
[2022-05-20 08:34:04] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-05-20 08:34:04] [INFO ] Deduced a trap composed of 7 places in 155 ms of which 0 ms to minimize.
[2022-05-20 08:34:04] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 1 ms to minimize.
[2022-05-20 08:34:05] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2022-05-20 08:34:05] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 1 ms to minimize.
[2022-05-20 08:34:06] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 0 ms to minimize.
[2022-05-20 08:34:06] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 0 ms to minimize.
[2022-05-20 08:34:06] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2022-05-20 08:34:07] [INFO ] Deduced a trap composed of 7 places in 122 ms of which 0 ms to minimize.
[2022-05-20 08:34:07] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2022-05-20 08:34:07] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 1 ms to minimize.
[2022-05-20 08:34:07] [INFO ] Deduced a trap composed of 6 places in 129 ms of which 0 ms to minimize.
[2022-05-20 08:34:07] [INFO ] Deduced a trap composed of 7 places in 131 ms of which 1 ms to minimize.
[2022-05-20 08:34:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4007 ms
[2022-05-20 08:34:07] [INFO ] After 16662ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3189 ms.
[2022-05-20 08:34:11] [INFO ] After 25033ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 2272 ms.
Support contains 18 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 127 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 98 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:34:13] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 08:34:14] [INFO ] Implicit Places using invariants in 1198 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:34:14] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:34:15] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:34:16] [INFO ] Implicit Places using invariants and state equation in 2087 ms returned []
Implicit Place search using SMT with State Equation took 3287 ms to find 0 implicit places.
[2022-05-20 08:34:17] [INFO ] Redundant transitions in 226 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:34:17] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 08:34:18] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7269 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 408 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2022-05-20 08:34:18] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 08:34:19] [INFO ] [Real]Absence check using 1100 positive place invariants in 206 ms returned sat
[2022-05-20 08:34:20] [INFO ] After 1204ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2022-05-20 08:34:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:34:21] [INFO ] After 105ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 08:34:21] [INFO ] After 2343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-05-20 08:34:21] [INFO ] [Nat]Absence check using 1100 positive place invariants in 211 ms returned sat
[2022-05-20 08:34:30] [INFO ] After 8736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-05-20 08:34:38] [INFO ] After 7358ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-05-20 08:34:38] [INFO ] Deduced a trap composed of 6 places in 184 ms of which 1 ms to minimize.
[2022-05-20 08:34:38] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 0 ms to minimize.
[2022-05-20 08:34:40] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 1 ms to minimize.
[2022-05-20 08:34:40] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 1 ms to minimize.
[2022-05-20 08:34:41] [INFO ] Deduced a trap composed of 6 places in 148 ms of which 0 ms to minimize.
[2022-05-20 08:34:42] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 1 ms to minimize.
[2022-05-20 08:34:42] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2022-05-20 08:34:42] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 0 ms to minimize.
[2022-05-20 08:34:42] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2022-05-20 08:34:43] [INFO ] Deduced a trap composed of 7 places in 137 ms of which 6 ms to minimize.
[2022-05-20 08:34:43] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 1 ms to minimize.
[2022-05-20 08:34:44] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 1 ms to minimize.
[2022-05-20 08:34:45] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 1 ms to minimize.
[2022-05-20 08:34:45] [INFO ] Deduced a trap composed of 8 places in 136 ms of which 0 ms to minimize.
[2022-05-20 08:34:46] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 1 ms to minimize.
[2022-05-20 08:34:46] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 1 ms to minimize.
[2022-05-20 08:34:47] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2022-05-20 08:34:48] [INFO ] Deduced a trap composed of 7 places in 153 ms of which 0 ms to minimize.
[2022-05-20 08:34:48] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2022-05-20 08:34:49] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 1 ms to minimize.
[2022-05-20 08:34:49] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 0 ms to minimize.
[2022-05-20 08:34:49] [INFO ] Deduced a trap composed of 6 places in 138 ms of which 1 ms to minimize.
[2022-05-20 08:34:49] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2022-05-20 08:34:51] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 1 ms to minimize.
[2022-05-20 08:34:51] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 0 ms to minimize.
[2022-05-20 08:34:52] [INFO ] Deduced a trap composed of 7 places in 151 ms of which 0 ms to minimize.
[2022-05-20 08:34:52] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 1 ms to minimize.
[2022-05-20 08:34:52] [INFO ] Deduced a trap composed of 6 places in 147 ms of which 0 ms to minimize.
[2022-05-20 08:34:53] [INFO ] Deduced a trap composed of 7 places in 272 ms of which 1 ms to minimize.
[2022-05-20 08:34:53] [INFO ] Deduced a trap composed of 6 places in 149 ms of which 1 ms to minimize.
[2022-05-20 08:34:53] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 0 ms to minimize.
[2022-05-20 08:34:53] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 7 ms to minimize.
[2022-05-20 08:34:53] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2022-05-20 08:34:54] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 0 ms to minimize.
[2022-05-20 08:34:54] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15784 ms
[2022-05-20 08:34:58] [INFO ] After 27968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 4739 ms.
[2022-05-20 08:35:03] [INFO ] After 42692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2022-05-20 08:35:03] [INFO ] Flatten gal took : 127 ms
[2022-05-20 08:35:04] [INFO ] Flatten gal took : 149 ms
[2022-05-20 08:35:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16766052891019803001.gal : 41 ms
[2022-05-20 08:35:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11551348809343777866.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms9655038822528746848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16766052891019803001.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11551348809343777866.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11551348809343777866.prop.
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :102 after 200
Reachability property AtomicPropp33 is true.
Reachability property AtomicPropp32 is true.
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :200 after 797
Reachability property AtomicPropp17 is true.
Reachability property AtomicPropp9 is true.
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :797 after 85375
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :85375 after 159692
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :159692 after 1.78795e+06
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.78795e+06 after 1.18256e+08
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.18256e+08 after 1.43595e+10
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.43595e+10 after 4.04729e+13
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :4.04729e+13 after 2.10799e+17
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :2.10799e+17 after 5.50289e+23
Detected timeout of ITS tools.
[2022-05-20 08:35:19] [INFO ] Flatten gal took : 118 ms
[2022-05-20 08:35:19] [INFO ] Applying decomposition
[2022-05-20 08:35:19] [INFO ] Flatten gal took : 124 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/graph3961659758385456457.txt' '-o' '/tmp/graph3961659758385456457.bin' '-w' '/tmp/graph3961659758385456457.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3961659758385456457.bin' '-l' '-1' '-v' '-w' '/tmp/graph3961659758385456457.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:35:19] [INFO ] Decomposing Gal with order
[2022-05-20 08:35:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:35:20] [INFO ] Removed a total of 584 redundant transitions.
[2022-05-20 08:35:20] [INFO ] Flatten gal took : 189 ms
[2022-05-20 08:35:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 563 ms.
[2022-05-20 08:35:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2338407070257542837.gal : 28 ms
[2022-05-20 08:35:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2673772325591194923.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms9655038822528746848;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2338407070257542837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2673772325591194923.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality2673772325591194923.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 2
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9294085749159159302
[2022-05-20 08:35:35] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9294085749159159302
Running compilation step : cd /tmp/ltsmin9294085749159159302;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9294085749159159302;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9294085749159159302;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
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' '!(F(X(((G(p0) U G((p0 U F(p0))))||F(X(p1))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 89 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:35:39] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:35:40] [INFO ] Implicit Places using invariants in 1195 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:35:40] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:35:42] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:35:42] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:35:43] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s462 0) (EQ s464 0)), p0:(AND (EQ s1487 1) (EQ s1489 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5907 ms.
Product exploration explored 100000 steps with 33333 reset in 6000 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 p1 (NOT p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 512 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-100A-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-00 finished in 16831 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U p1)&&F(p2)))&&X(X(!(p3 U p4)))))'
Support contains 8 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 95 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:35:56] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:35:57] [INFO ] Implicit Places using invariants in 1261 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:35:57] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:35:59] [INFO ] Implicit Places using invariants and state equation in 1669 ms returned []
Implicit Place search using SMT with State Equation took 2931 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:35:59] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:36:00] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 362 ms :[(OR (NOT p2) p4 p1), (OR (NOT p2) p4 p1), true, p1, p4, (NOT p2)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=p4, acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p4)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s1542 1) (EQ s1544 1)), p0:(AND (EQ s1578 1) (EQ s1601 1)), p2:(OR (EQ s443 0) (EQ s450 0)), p4:(AND (EQ s1117 1) (EQ s1119 1)), p3:(AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5888 ms.
Product exploration explored 100000 steps with 33333 reset in 6055 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 (NOT p4) (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), true, (X (X p2)), (X (X (NOT p4))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) (NOT p0) p2 (NOT p4) (NOT p3))
Knowledge based reduction with 10 factoid took 490 ms. Reduced automaton from 6 states, 11 edges and 5 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-100A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-01 finished in 16873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||(!(X(p1) U p2)&&(X(p3)||p0)))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 79 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:13] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:36:14] [INFO ] Implicit Places using invariants in 1233 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:14] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:36:16] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2951 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:16] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:36:17] [INFO ] Dead Transitions using invariants and state equation in 1045 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) p2)), (OR (NOT p3) (AND p1 p2)), (AND p2 p1)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p2 p1) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p3 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(EQ s2422 0), p2:(AND (EQ s33 1) (EQ s50 1)), p1:(EQ s2422 1), p3:(OR (EQ s1016 0) (EQ s1027 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 8007 ms.
Product exploration explored 100000 steps with 50000 reset in 8181 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 (NOT p2) (NOT p1) p3), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), true, (X (X (NOT (AND (NOT p2) p3 p1)))), (X (X (NOT (OR (AND p2 p1) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2)))
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 5 states, 8 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-100A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-04 finished in 20613 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((X(p1)||p2))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 77 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:33] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:36:34] [INFO ] Implicit Places using invariants in 1216 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:34] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:36:36] [INFO ] Implicit Places using invariants and state equation in 1696 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:36] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 08:36:37] [INFO ] Dead Transitions using invariants and state equation in 1140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s811 1) (EQ s821 1)), p0:(AND (EQ s506 1) (EQ s521 1)), p1:(OR (EQ s2129 0) (EQ s2148 0))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-05 finished in 4290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((G(X(p0))&&p1) U p2)&&F(p2)))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 93 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:38] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:36:39] [INFO ] Implicit Places using invariants in 1177 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:39] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:36:40] [INFO ] Implicit Places using invariants and state equation in 1618 ms returned []
Implicit Place search using SMT with State Equation took 2795 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:36:40] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:36:41] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), p0, (OR (NOT p2) p0), true, true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}]], initial=4, aps=[p2:(AND (EQ s879 1) (EQ s898 1)), p0:(AND (EQ s1917 1) (EQ s1919 1)), p1:(OR (AND (EQ s1917 1) (EQ s1919 1)) (EQ s2397 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1292 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-06 finished in 5479 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 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 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 2500 transition count 1800
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 3 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2498 transition count 1798
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 2497 transition count 1797
Applied a total of 9 rules in 278 ms. Remains 2497 /2503 variables (removed 6) and now considering 1797/1802 (removed 5) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:36:43] [INFO ] Computed 1100 place invariants in 4 ms
[2022-05-20 08:36:44] [INFO ] Implicit Places using invariants in 1230 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:36:45] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 08:36:46] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2897 ms to find 0 implicit places.
[2022-05-20 08:36:46] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:36:46] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 08:36:47] [INFO ] Dead Transitions using invariants and state equation in 1093 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2497/2503 places, 1797/1802 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2503 places, 1797/1802 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s31 1) (NEQ s33 1)), p1:(NEQ s1821 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 1370 ms.
Product exploration explored 100000 steps with 0 reset in 1796 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 2222 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 338 ms. (steps per millisecond=29 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 105370 steps, run timeout after 3008 ms. (steps per millisecond=35 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 105370 steps, saw 104172 distinct states, run finished after 3008 ms. (steps per millisecond=35 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:36:57] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 08:36:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 196 ms returned sat
[2022-05-20 08:36:58] [INFO ] After 1037ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 08:36:59] [INFO ] After 1170ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:36:59] [INFO ] After 1886ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:36:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 191 ms returned sat
[2022-05-20 08:37:00] [INFO ] After 1037ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:01] [INFO ] After 1280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2022-05-20 08:37:01] [INFO ] After 2088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 81 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 87 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 119708 steps, run timeout after 3003 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 119708 steps, saw 118320 distinct states, run finished after 3003 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:04] [INFO ] Computed 1100 place invariants in 5 ms
[2022-05-20 08:37:05] [INFO ] [Real]Absence check using 1100 positive place invariants in 210 ms returned sat
[2022-05-20 08:37:06] [INFO ] After 1071ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 08:37:06] [INFO ] After 1209ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:06] [INFO ] After 1930ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:07] [INFO ] [Nat]Absence check using 1100 positive place invariants in 197 ms returned sat
[2022-05-20 08:37:08] [INFO ] After 1032ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:08] [INFO ] After 1288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2022-05-20 08:37:08] [INFO ] After 2124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 93 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 85 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:09] [INFO ] Computed 1100 place invariants in 2 ms
[2022-05-20 08:37:10] [INFO ] Implicit Places using invariants in 1203 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:10] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 08:37:11] [INFO ] Implicit Places using invariants and state equation in 1680 ms returned []
Implicit Place search using SMT with State Equation took 2884 ms to find 0 implicit places.
[2022-05-20 08:37:12] [INFO ] Redundant transitions in 121 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:12] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 08:37:13] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:13] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 08:37:13] [INFO ] [Real]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 08:37:15] [INFO ] After 1007ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 08:37:15] [INFO ] After 1129ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:15] [INFO ] After 1838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:15] [INFO ] [Nat]Absence check using 1100 positive place invariants in 206 ms returned sat
[2022-05-20 08:37:16] [INFO ] After 1069ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:17] [INFO ] After 1314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 146 ms.
[2022-05-20 08:37:17] [INFO ] After 2155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:17] [INFO ] Flatten gal took : 62 ms
[2022-05-20 08:37:17] [INFO ] Flatten gal took : 63 ms
[2022-05-20 08:37:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3500333235951278726.gal : 7 ms
[2022-05-20 08:37:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15597605610529419500.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14684394109557076970;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3500333235951278726.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15597605610529419500.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality15597605610529419500.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 103
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :103 after 200
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :200 after 421
Reachability property apf1 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421 after 352879
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :352879 after 6.11457e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.11457e+06 after 1.98016e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.98016e+11 after 1.37462e+24
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.37462e+24 after 2.14748e+47
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.14748e+47 after 5.30524e+96
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.30524e+96 after 1.15204e+193
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.62798e+359,4.6283,90652,2,5534,20,351052,7,0,11792,460551,0
Total reachable state count : 4.627981567465891994167206739152956628174e+359

Verifying 2 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,40000,4.63865,90652,2,2578,20,351052,8,0,11798,460551,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,40000,4.64106,90652,2,2578,20,351052,8,0,11799,460551,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 377 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 88 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:22] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:37:23] [INFO ] Implicit Places using invariants in 1229 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:23] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:37:25] [INFO ] Implicit Places using invariants and state equation in 1537 ms returned []
Implicit Place search using SMT with State Equation took 2769 ms to find 0 implicit places.
[2022-05-20 08:37:25] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:25] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 08:37:26] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 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 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 264 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 98482 steps, run timeout after 3004 ms. (steps per millisecond=32 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 98482 steps, saw 97311 distinct states, run finished after 3004 ms. (steps per millisecond=32 ) properties seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:30] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 08:37:31] [INFO ] [Real]Absence check using 1100 positive place invariants in 198 ms returned sat
[2022-05-20 08:37:32] [INFO ] After 1034ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 08:37:32] [INFO ] After 1163ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:32] [INFO ] After 1894ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:33] [INFO ] [Nat]Absence check using 1100 positive place invariants in 197 ms returned sat
[2022-05-20 08:37:34] [INFO ] After 1051ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:34] [INFO ] After 1296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2022-05-20 08:37:34] [INFO ] After 2125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 73 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 86 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 122458 steps, run timeout after 3004 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122458 steps, saw 121026 distinct states, run finished after 3005 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:38] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 08:37:38] [INFO ] [Real]Absence check using 1100 positive place invariants in 206 ms returned sat
[2022-05-20 08:37:40] [INFO ] After 1078ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 08:37:40] [INFO ] After 1270ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:40] [INFO ] After 1983ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:40] [INFO ] [Nat]Absence check using 1100 positive place invariants in 204 ms returned sat
[2022-05-20 08:37:42] [INFO ] After 1100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:42] [INFO ] After 1354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 145 ms.
[2022-05-20 08:37:42] [INFO ] After 2208ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 69 ms.
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 82 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 83 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:42] [INFO ] Computed 1100 place invariants in 4 ms
[2022-05-20 08:37:43] [INFO ] Implicit Places using invariants in 1259 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:43] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:37:45] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 2838 ms to find 0 implicit places.
[2022-05-20 08:37:45] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:45] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 08:37:46] [INFO ] Dead Transitions using invariants and state equation in 1085 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 81 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:37:46] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 08:37:47] [INFO ] [Real]Absence check using 1100 positive place invariants in 203 ms returned sat
[2022-05-20 08:37:48] [INFO ] After 1060ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-20 08:37:48] [INFO ] After 1192ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:48] [INFO ] After 1896ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 08:37:49] [INFO ] [Nat]Absence check using 1100 positive place invariants in 199 ms returned sat
[2022-05-20 08:37:50] [INFO ] After 1050ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:50] [INFO ] After 1297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 142 ms.
[2022-05-20 08:37:50] [INFO ] After 2135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-20 08:37:50] [INFO ] Flatten gal took : 57 ms
[2022-05-20 08:37:50] [INFO ] Flatten gal took : 57 ms
[2022-05-20 08:37:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5602980726763431886.gal : 11 ms
[2022-05-20 08:37:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4368352143616952663.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms3561034578078666911;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5602980726763431886.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4368352143616952663.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality4368352143616952663.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 14
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :14 after 28
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :28 after 53
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :53 after 103
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :103 after 200
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :200 after 421
Reachability property apf1 is true.
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :421 after 352879
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :352879 after 6.11457e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6.11457e+06 after 1.98016e+11
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.98016e+11 after 1.37462e+24
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.37462e+24 after 2.14748e+47
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.14748e+47 after 5.30524e+96
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.30524e+96 after 1.15204e+193
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,4.62798e+359,4.49419,90652,2,5534,20,351052,7,0,11792,460551,0
Total reachable state count : 4.627981567465891994167206739152956628174e+359

Verifying 2 reachability properties.
Reachability property apf1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf1,40000,4.50303,90652,2,2578,20,351052,8,0,11798,460551,0
Reachability property apf3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf3,40000,4.50531,90652,2,2578,20,351052,8,0,11799,460551,0
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1361 ms.
Product exploration explored 100000 steps with 0 reset in 1783 ms.
Built C files in :
/tmp/ltsmin9482417361029310791
[2022-05-20 08:37:59] [INFO ] Too many transitions (1797) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:37:59] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9482417361029310791
Running compilation step : cd /tmp/ltsmin9482417361029310791;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9482417361029310791;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9482417361029310791;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 3 out of 2497 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2497/2497 places, 1797/1797 transitions.
Applied a total of 0 rules in 85 ms. Remains 2497 /2497 variables (removed 0) and now considering 1797/1797 (removed 0) transitions.
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:38:02] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:38:03] [INFO ] Implicit Places using invariants in 1237 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:38:03] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:38:05] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 2816 ms to find 0 implicit places.
[2022-05-20 08:38:05] [INFO ] Redundant transitions in 43 ms returned []
// Phase 1: matrix 1797 rows 2497 cols
[2022-05-20 08:38:05] [INFO ] Computed 1100 place invariants in 6 ms
[2022-05-20 08:38:06] [INFO ] Dead Transitions using invariants and state equation in 1080 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2497/2497 places, 1797/1797 transitions.
Built C files in :
/tmp/ltsmin9589063584102230914
[2022-05-20 08:38:06] [INFO ] Too many transitions (1797) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:38:06] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9589063584102230914
Running compilation step : cd /tmp/ltsmin9589063584102230914;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9589063584102230914;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9589063584102230914;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 08:38:09] [INFO ] Flatten gal took : 56 ms
[2022-05-20 08:38:09] [INFO ] Flatten gal took : 56 ms
[2022-05-20 08:38:09] [INFO ] Time to serialize gal into /tmp/LTL7373727589102705005.gal : 9 ms
[2022-05-20 08:38:09] [INFO ] Time to serialize properties into /tmp/LTL3106364662857449030.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/LTL7373727589102705005.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3106364662857449030.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/LTL7373727...266
Read 1 LTL properties
Checking formula 0 : !((F((G("((p32==0)||(p34==0))"))||(G("(p1822==0)")))))
Formula 0 simplified : !F(G"((p32==0)||(p34==0))" | G"(p1822==0)")
Detected timeout of ITS tools.
[2022-05-20 08:38:24] [INFO ] Flatten gal took : 54 ms
[2022-05-20 08:38:24] [INFO ] Applying decomposition
[2022-05-20 08:38:24] [INFO ] Flatten gal took : 55 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/graph2107190871458726637.txt' '-o' '/tmp/graph2107190871458726637.bin' '-w' '/tmp/graph2107190871458726637.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2107190871458726637.bin' '-l' '-1' '-v' '-w' '/tmp/graph2107190871458726637.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:38:24] [INFO ] Decomposing Gal with order
[2022-05-20 08:38:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:38:24] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-20 08:38:25] [INFO ] Flatten gal took : 92 ms
[2022-05-20 08:38:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 23 ms.
[2022-05-20 08:38:25] [INFO ] Time to serialize gal into /tmp/LTL16264857988394440782.gal : 12 ms
[2022-05-20 08:38:25] [INFO ] Time to serialize properties into /tmp/LTL1964945044322231681.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/LTL16264857988394440782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1964945044322231681.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/LTL1626485...246
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u10.p32==0)||(i0.u10.p34==0))"))||(G("(i23.u582.p1822==0)")))))
Formula 0 simplified : !F(G"((i0.u10.p32==0)||(i0.u10.p34==0))" | G"(i23.u582.p1822==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15094653303369455691
[2022-05-20 08:38:40] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15094653303369455691
Running compilation step : cd /tmp/ltsmin15094653303369455691;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15094653303369455691;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15094653303369455691;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-08 finished in 119683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(p1)||p0) U X(G(!X(F(p2))))))'
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 72 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:38:43] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:38:44] [INFO ] Implicit Places using invariants in 1242 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:38:44] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 08:38:46] [INFO ] Implicit Places using invariants and state equation in 1683 ms returned []
Implicit Place search using SMT with State Equation took 2929 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:38:46] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:38:47] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 340 ms :[p2, (AND p1 p2), p2, true, p2]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (EQ s387 1) (EQ s389 1)), p2:(AND (EQ s231 1) (EQ s246 1)), p0:(OR (NOT (AND (EQ s387 1) (EQ s389 1))) (AND (EQ s1817 1) (EQ s1819 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1422 ms.
Product exploration explored 100000 steps with 0 reset in 1778 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 414 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 127 ms :[true, p2, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145472 steps, run timeout after 3004 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145472 steps, saw 144187 distinct states, run finished after 3004 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:38:54] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:38:55] [INFO ] [Real]Absence check using 1101 positive place invariants in 213 ms returned sat
[2022-05-20 08:38:56] [INFO ] After 1714ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:38:56] [INFO ] [Nat]Absence check using 1101 positive place invariants in 212 ms returned sat
[2022-05-20 08:38:59] [INFO ] After 2288ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:38:59] [INFO ] After 2675ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 113 ms.
[2022-05-20 08:38:59] [INFO ] After 3442ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 163 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 0 with 399 rules applied. Total rules applied 403 place count 2501 transition count 1800
Applied a total of 403 rules in 255 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 135185 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135185 steps, saw 129437 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:39:03] [INFO ] Computed 1101 place invariants in 14 ms
[2022-05-20 08:39:04] [INFO ] [Real]Absence check using 1101 positive place invariants in 210 ms returned sat
[2022-05-20 08:39:05] [INFO ] After 1758ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:39:05] [INFO ] [Nat]Absence check using 1101 positive place invariants in 198 ms returned sat
[2022-05-20 08:39:07] [INFO ] After 1556ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:39:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:39:09] [INFO ] After 1698ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:39:09] [INFO ] After 1851ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2022-05-20 08:39:09] [INFO ] After 4104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 152 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:39:09] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 08:39:10] [INFO ] Implicit Places using invariants in 1226 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:39:10] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:39:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:39:12] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 3331 ms to find 0 implicit places.
[2022-05-20 08:39:12] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:39:12] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:39:14] [INFO ] Dead Transitions using invariants and state equation in 1084 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7293 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 236 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2022-05-20 08:39:14] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:39:14] [INFO ] [Real]Absence check using 1100 positive place invariants in 192 ms returned sat
[2022-05-20 08:39:15] [INFO ] After 1614ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:39:16] [INFO ] [Nat]Absence check using 1100 positive place invariants in 219 ms returned sat
[2022-05-20 08:39:19] [INFO ] After 2475ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:39:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:39:19] [INFO ] After 104ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:39:19] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-20 08:39:19] [INFO ] After 3499ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:39:19] [INFO ] Flatten gal took : 106 ms
[2022-05-20 08:39:19] [INFO ] Flatten gal took : 124 ms
[2022-05-20 08:39:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8031244565707683905.gal : 7 ms
[2022-05-20 08:39:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8015624608245758659.prop : 211 ms
Invoking ITS tools like this :cd /tmp/redAtoms13701160862396093595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8031244565707683905.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8015624608245758659.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality8015624608245758659.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 997
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :997 after 614431
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :614431 after 1.13494e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.13494e+07 after 6.66589e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.66589e+09 after 1.21679e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.21679e+13 after 5.33793e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.33793e+16 after 7.02596e+20
Detected timeout of ITS tools.
[2022-05-20 08:39:35] [INFO ] Flatten gal took : 110 ms
[2022-05-20 08:39:35] [INFO ] Applying decomposition
[2022-05-20 08:39:35] [INFO ] Flatten gal took : 109 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/graph9738998028676143261.txt' '-o' '/tmp/graph9738998028676143261.bin' '-w' '/tmp/graph9738998028676143261.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph9738998028676143261.bin' '-l' '-1' '-v' '-w' '/tmp/graph9738998028676143261.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:39:35] [INFO ] Decomposing Gal with order
[2022-05-20 08:39:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:39:35] [INFO ] Removed a total of 592 redundant transitions.
[2022-05-20 08:39:35] [INFO ] Flatten gal took : 108 ms
[2022-05-20 08:39:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 318 ms.
[2022-05-20 08:39:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17225704699090840753.gal : 46 ms
[2022-05-20 08:39:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6043698006832716676.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13701160862396093595;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17225704699090840753.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6043698006832716676.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality6043698006832716676.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 2
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12522618078795417678
[2022-05-20 08:39:51] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12522618078795417678
Running compilation step : cd /tmp/ltsmin12522618078795417678;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12522618078795417678;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12522618078795417678;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 566 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 138 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 104 ms :[true, p2, p2, p2]
Support contains 2 out of 2503 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 74 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:39:55] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:39:56] [INFO ] Implicit Places using invariants in 1136 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:39:56] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:39:57] [INFO ] Implicit Places using invariants and state equation in 1236 ms returned []
Implicit Place search using SMT with State Equation took 2374 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:39:57] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:39:58] [INFO ] Dead Transitions using invariants and state equation in 1065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p2), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[true, p2, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 141329 steps, run timeout after 3002 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141329 steps, saw 140068 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:40:01] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:40:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 217 ms returned sat
[2022-05-20 08:40:03] [INFO ] After 1706ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:40:04] [INFO ] [Nat]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 08:40:06] [INFO ] After 2128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:40:06] [INFO ] After 2512ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 121 ms.
[2022-05-20 08:40:06] [INFO ] After 3296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 186 ms.
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 0 with 399 rules applied. Total rules applied 403 place count 2501 transition count 1800
Applied a total of 403 rules in 253 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131885 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131885 steps, saw 126238 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:40:10] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:40:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 205 ms returned sat
[2022-05-20 08:40:12] [INFO ] After 1728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:40:12] [INFO ] [Nat]Absence check using 1101 positive place invariants in 199 ms returned sat
[2022-05-20 08:40:14] [INFO ] After 1458ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:40:14] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:40:16] [INFO ] After 1639ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:40:16] [INFO ] After 1798ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-05-20 08:40:16] [INFO ] After 3956ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 177 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 76 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 92 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:40:16] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:40:17] [INFO ] Implicit Places using invariants in 1283 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:40:17] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 08:40:18] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:40:20] [INFO ] Implicit Places using invariants and state equation in 2070 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
[2022-05-20 08:40:20] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:40:20] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:40:21] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7293 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 242 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2022-05-20 08:40:21] [INFO ] Computed 1100 place invariants in 9 ms
[2022-05-20 08:40:22] [INFO ] [Real]Absence check using 1100 positive place invariants in 204 ms returned sat
[2022-05-20 08:40:23] [INFO ] After 1705ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:40:23] [INFO ] [Nat]Absence check using 1100 positive place invariants in 208 ms returned sat
[2022-05-20 08:40:26] [INFO ] After 2547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:40:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:40:26] [INFO ] After 100ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:40:26] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-20 08:40:26] [INFO ] After 3532ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:40:26] [INFO ] Flatten gal took : 108 ms
[2022-05-20 08:40:26] [INFO ] Flatten gal took : 136 ms
[2022-05-20 08:40:26] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17421870708002012109.gal : 7 ms
[2022-05-20 08:40:26] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2375902550797083027.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12784278852272083640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17421870708002012109.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2375902550797083027.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality2375902550797083027.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 997
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :997 after 614431
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :614431 after 1.13494e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.13494e+07 after 6.66589e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.66589e+09 after 1.21679e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.21679e+13 after 5.33793e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.33793e+16 after 7.02596e+20
Detected timeout of ITS tools.
[2022-05-20 08:40:42] [INFO ] Flatten gal took : 108 ms
[2022-05-20 08:40:42] [INFO ] Applying decomposition
[2022-05-20 08:40:42] [INFO ] Flatten gal took : 109 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/graph6774527843453665134.txt' '-o' '/tmp/graph6774527843453665134.bin' '-w' '/tmp/graph6774527843453665134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6774527843453665134.bin' '-l' '-1' '-v' '-w' '/tmp/graph6774527843453665134.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:40:42] [INFO ] Decomposing Gal with order
[2022-05-20 08:40:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:40:42] [INFO ] Removed a total of 595 redundant transitions.
[2022-05-20 08:40:42] [INFO ] Flatten gal took : 118 ms
[2022-05-20 08:40:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 202 ms.
[2022-05-20 08:40:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17977960615689095076.gal : 12 ms
[2022-05-20 08:40:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12919448332600176528.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms12784278852272083640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17977960615689095076.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12919448332600176528.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality12919448332600176528.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 107670
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1380880256608128434
[2022-05-20 08:40:58] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1380880256608128434
Running compilation step : cd /tmp/ltsmin1380880256608128434;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1380880256608128434;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1380880256608128434;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [(NOT p2), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 172 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 212 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 168 ms :[true, p2, p2, p2]
Product exploration explored 100000 steps with 0 reset in 1438 ms.
Product exploration explored 100000 steps with 0 reset in 1666 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 114 ms :[true, p2, p2, p2]
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 2503 transition count 1802
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 449 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
[2022-05-20 08:41:05] [INFO ] Redundant transitions in 46 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:05] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:41:06] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2503/2503 places, 1802/1802 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Product exploration explored 100000 steps with 0 reset in 1285 ms.
Product exploration explored 100000 steps with 0 reset in 1689 ms.
Built C files in :
/tmp/ltsmin15007243007796151676
[2022-05-20 08:41:10] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15007243007796151676
Running compilation step : cd /tmp/ltsmin15007243007796151676;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15007243007796151676;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15007243007796151676;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 133 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:13] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:41:15] [INFO ] Implicit Places using invariants in 2187 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:15] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:41:17] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 3905 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:17] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:41:18] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Built C files in :
/tmp/ltsmin18218295619626111853
[2022-05-20 08:41:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18218295619626111853
Running compilation step : cd /tmp/ltsmin18218295619626111853;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18218295619626111853;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18218295619626111853;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 08:41:21] [INFO ] Flatten gal took : 141 ms
[2022-05-20 08:41:21] [INFO ] Flatten gal took : 162 ms
[2022-05-20 08:41:21] [INFO ] Time to serialize gal into /tmp/LTL2759485862594956662.gal : 17 ms
[2022-05-20 08:41:21] [INFO ] Time to serialize properties into /tmp/LTL4460809017624082487.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/LTL2759485862594956662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4460809017624082487.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/LTL2759485...266
Read 1 LTL properties
Checking formula 0 : !(((!(((X("((p387==1)&&(p389==1))"))||(!("((p387==1)&&(p389==1))")))||("((p1817==1)&&(p1819==1))")))U(X(G(!(X(F("((p231==1)&&(p246==1)...165
Formula 0 simplified : !(!(!"((p387==1)&&(p389==1))" | "((p1817==1)&&(p1819==1))" | X"((p387==1)&&(p389==1))") U XG!XF"((p231==1)&&(p246==1))")
Detected timeout of ITS tools.
[2022-05-20 08:41:36] [INFO ] Flatten gal took : 108 ms
[2022-05-20 08:41:36] [INFO ] Applying decomposition
[2022-05-20 08:41:36] [INFO ] Flatten gal took : 137 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/graph15336648304607182465.txt' '-o' '/tmp/graph15336648304607182465.bin' '-w' '/tmp/graph15336648304607182465.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15336648304607182465.bin' '-l' '-1' '-v' '-w' '/tmp/graph15336648304607182465.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:41:37] [INFO ] Decomposing Gal with order
[2022-05-20 08:41:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:41:37] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 08:41:37] [INFO ] Flatten gal took : 86 ms
[2022-05-20 08:41:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 153 ms.
[2022-05-20 08:41:37] [INFO ] Time to serialize gal into /tmp/LTL18167560777500705645.gal : 29 ms
[2022-05-20 08:41:37] [INFO ] Time to serialize properties into /tmp/LTL16170023951812017604.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/LTL18167560777500705645.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16170023951812017604.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/LTL1816756...247
Read 1 LTL properties
Checking formula 0 : !(((!(((X("((i4.i1.i0.i0.u123.p387==1)&&(i4.i1.i0.i0.u123.p389==1))"))||(!("((i4.i1.i0.i0.u123.p387==1)&&(i4.i1.i0.i0.u123.p389==1))")...265
Formula 0 simplified : !(!(!"((i4.i1.i0.i0.u123.p387==1)&&(i4.i1.i0.i0.u123.p389==1))" | "((i23.u580.p1817==1)&&(i23.u580.p1819==1))" | X"((i4.i1.i0.i0.u12...243
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14816520383260485662
[2022-05-20 08:41:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14816520383260485662
Running compilation step : cd /tmp/ltsmin14816520383260485662;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14816520383260485662;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14816520383260485662;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-09 finished in 192496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(X((p0&&(X(X(!(p2 U X(!p2))))||p1))))))'
Support contains 5 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 67 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:55] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:41:57] [INFO ] Implicit Places using invariants in 1593 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:57] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:41:58] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 3266 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:41:59] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:42:00] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 423 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={0} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(NOT p0), acceptance={0} source=5 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=9 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(OR (EQ s1218 0) (EQ s1225 0)), p1:(OR (EQ s1506 0) (EQ s1521 0)), p2:(NEQ s2099 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 6042 ms.
Product exploration explored 100000 steps with 33333 reset in 6132 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 p2), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1 p2)
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 10 states, 22 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-100A-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-10 finished in 17254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 3 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 71 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:42:12] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 08:42:14] [INFO ] Implicit Places using invariants in 1216 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:42:14] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 08:42:15] [INFO ] Implicit Places using invariants and state equation in 1702 ms returned []
Implicit Place search using SMT with State Equation took 2948 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:42:15] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:42:16] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s547 0), p0:(AND (EQ s516 1) (EQ s527 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-11 finished in 4188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||p1))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 165 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:17] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:42:18] [INFO ] Implicit Places using invariants in 1196 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:18] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:42:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:42:20] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 2849 ms to find 0 implicit places.
[2022-05-20 08:42:20] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:20] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:42:21] [INFO ] Dead Transitions using invariants and state equation in 1316 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1987 1) (EQ s1989 1)), p1:(AND (EQ s2265 1) (EQ s2299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 60 reset in 1277 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 1 ms.
FORMULA ShieldPPPt-PT-100A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldPPPt-PT-100A-LTLFireability-12 finished in 5763 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(!(p0 U p1))||p2))||(X(p0) U p0))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Applied a total of 0 rules in 70 ms. Remains 2503 /2503 variables (removed 0) and now considering 1802/1802 (removed 0) transitions.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:42:22] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 08:42:24] [INFO ] Implicit Places using invariants in 1318 ms returned []
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:42:24] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:42:25] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2844 ms to find 0 implicit places.
// Phase 1: matrix 1802 rows 2503 cols
[2022-05-20 08:42:25] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:42:26] [INFO ] Dead Transitions using invariants and state equation in 1192 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2503/2503 places, 1802/1802 transitions.
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), p1]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s245 1) (EQ s260 1)), p1:(EQ s1299 1), p2:(EQ s1601 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 5772 ms.
Product exploration explored 100000 steps with 33333 reset in 5995 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1 (NOT p2)))))
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 4 states, 5 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldPPPt-PT-100A-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldPPPt-PT-100A-LTLFireability-14 finished in 16473 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((p0 U !(F(X(F(X(p1)))) U p0))))))'
Support contains 4 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 154 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:39] [INFO ] Computed 1101 place invariants in 6 ms
[2022-05-20 08:42:40] [INFO ] Implicit Places using invariants in 1240 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:40] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:42:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:42:42] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 3032 ms to find 0 implicit places.
[2022-05-20 08:42:42] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:42] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:42:43] [INFO ] Dead Transitions using invariants and state equation in 1055 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Stuttering acceptance computed with spot in 144 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={1} source=2 dest: 3}, { cond=p0, acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s243 1) (EQ s250 1)), p1:(AND (EQ s7 1) (EQ s9 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 1254 ms.
Product exploration explored 100000 steps with 0 reset in 1621 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 295 ms. Reduced automaton from 5 states, 15 edges and 2 AP to 5 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 59691 steps, run timeout after 3004 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 59691 steps, saw 58707 distinct states, run finished after 3007 ms. (steps per millisecond=19 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:42:51] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:42:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 194 ms returned sat
[2022-05-20 08:42:53] [INFO ] After 2289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 08:42:54] [INFO ] [Nat]Absence check using 1101 positive place invariants in 192 ms returned sat
[2022-05-20 08:42:56] [INFO ] After 2121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 08:42:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:42:57] [INFO ] After 1293ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:42:58] [INFO ] After 2037ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 504 ms.
[2022-05-20 08:42:59] [INFO ] After 5544ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1669 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 151 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 80984 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 80984 steps, saw 77316 distinct states, run finished after 3003 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:43:04] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:43:05] [INFO ] [Real]Absence check using 1101 positive place invariants in 197 ms returned sat
[2022-05-20 08:43:07] [INFO ] After 2354ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 08:43:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 210 ms returned sat
[2022-05-20 08:43:11] [INFO ] After 2829ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 08:43:11] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:43:15] [INFO ] After 4858ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:43:19] [INFO ] After 8215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1979 ms.
[2022-05-20 08:43:21] [INFO ] After 13971ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1640 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 84 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:43:23] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:43:24] [INFO ] Implicit Places using invariants in 1321 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:43:24] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:43:25] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:43:26] [INFO ] Implicit Places using invariants and state equation in 2137 ms returned []
Implicit Place search using SMT with State Equation took 3459 ms to find 0 implicit places.
[2022-05-20 08:43:26] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:43:26] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 08:43:27] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 233 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2022-05-20 08:43:27] [INFO ] Computed 1100 place invariants in 10 ms
[2022-05-20 08:43:28] [INFO ] [Real]Absence check using 1100 positive place invariants in 210 ms returned sat
[2022-05-20 08:43:30] [INFO ] After 2462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 08:43:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 188 ms returned sat
[2022-05-20 08:43:35] [INFO ] After 4511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 08:43:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:43:38] [INFO ] After 2278ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:43:38] [INFO ] After 3062ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2351 ms.
[2022-05-20 08:43:41] [INFO ] After 10835ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:43:41] [INFO ] Flatten gal took : 112 ms
[2022-05-20 08:43:41] [INFO ] Flatten gal took : 113 ms
[2022-05-20 08:43:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14924444785536323468.gal : 8 ms
[2022-05-20 08:43:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11808587115330356032.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10391531029535158425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14924444785536323468.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11808587115330356032.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11808587115330356032.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :102 after 200
Reachability property apf3 is true.
Reachability property apf2 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :200 after 797
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :797 after 81893
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :81893 after 848220
Detected timeout of ITS tools.
[2022-05-20 08:43:56] [INFO ] Flatten gal took : 112 ms
[2022-05-20 08:43:56] [INFO ] Applying decomposition
[2022-05-20 08:43:56] [INFO ] Flatten gal took : 112 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/graph8201632129797516598.txt' '-o' '/tmp/graph8201632129797516598.bin' '-w' '/tmp/graph8201632129797516598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8201632129797516598.bin' '-l' '-1' '-v' '-w' '/tmp/graph8201632129797516598.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:43:56] [INFO ] Decomposing Gal with order
[2022-05-20 08:43:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:43:57] [INFO ] Removed a total of 592 redundant transitions.
[2022-05-20 08:43:57] [INFO ] Flatten gal took : 108 ms
[2022-05-20 08:43:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 242 ms.
[2022-05-20 08:43:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9436025559328804666.gal : 22 ms
[2022-05-20 08:43:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17139725590778610233.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10391531029535158425;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9436025559328804666.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17139725590778610233.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality17139725590778610233.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1938093500563377260
[2022-05-20 08:44:12] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1938093500563377260
Running compilation step : cd /tmp/ltsmin1938093500563377260;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1938093500563377260;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1938093500563377260;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 286 ms. Reduced automaton from 5 states, 15 edges and 2 AP to 5 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 182 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 172 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 83 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:16] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:44:17] [INFO ] Implicit Places using invariants in 1205 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:17] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:44:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:44:19] [INFO ] Implicit Places using invariants and state equation in 1703 ms returned []
Implicit Place search using SMT with State Equation took 2909 ms to find 0 implicit places.
[2022-05-20 08:44:19] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:19] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:44:20] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 250 ms. Reduced automaton from 5 states, 15 edges and 2 AP to 5 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 195 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 87504 steps, run timeout after 3005 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87504 steps, saw 86384 distinct states, run finished after 3005 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:24] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:44:25] [INFO ] [Real]Absence check using 1101 positive place invariants in 200 ms returned sat
[2022-05-20 08:44:27] [INFO ] After 2420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 08:44:27] [INFO ] [Nat]Absence check using 1101 positive place invariants in 215 ms returned sat
[2022-05-20 08:44:30] [INFO ] After 2333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 08:44:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:44:31] [INFO ] After 1377ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:44:32] [INFO ] After 2182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 551 ms.
[2022-05-20 08:44:33] [INFO ] After 6012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1522 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 398 times.
Drop transitions removed 398 transitions
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 2501 transition count 1800
Applied a total of 398 rules in 161 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 325 ms. (steps per millisecond=30 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 78413 steps, run timeout after 3002 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78413 steps, saw 74817 distinct states, run finished after 3004 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:38] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:44:39] [INFO ] [Real]Absence check using 1101 positive place invariants in 204 ms returned sat
[2022-05-20 08:44:41] [INFO ] After 2459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 08:44:42] [INFO ] [Nat]Absence check using 1101 positive place invariants in 212 ms returned sat
[2022-05-20 08:44:44] [INFO ] After 2711ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 08:44:44] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:44:49] [INFO ] After 4898ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:44:53] [INFO ] After 8263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1903 ms.
[2022-05-20 08:44:55] [INFO ] After 13847ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 1688 ms.
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 80 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:56] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:44:58] [INFO ] Implicit Places using invariants in 1273 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:44:58] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:44:58] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:45:00] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 3388 ms to find 0 implicit places.
[2022-05-20 08:45:00] [INFO ] Redundant transitions in 37 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:45:00] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:45:01] [INFO ] Dead Transitions using invariants and state equation in 1100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7289 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 233 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2022-05-20 08:45:01] [INFO ] Computed 1100 place invariants in 7 ms
[2022-05-20 08:45:02] [INFO ] [Real]Absence check using 1100 positive place invariants in 200 ms returned sat
[2022-05-20 08:45:04] [INFO ] After 2326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-20 08:45:04] [INFO ] [Nat]Absence check using 1100 positive place invariants in 211 ms returned sat
[2022-05-20 08:45:09] [INFO ] After 4627ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-20 08:45:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:45:12] [INFO ] After 2342ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:45:12] [INFO ] After 3155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2493 ms.
[2022-05-20 08:45:15] [INFO ] After 11241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-05-20 08:45:15] [INFO ] Flatten gal took : 106 ms
[2022-05-20 08:45:15] [INFO ] Flatten gal took : 107 ms
[2022-05-20 08:45:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11792803583037338851.gal : 6 ms
[2022-05-20 08:45:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11377633738619439519.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms18042102833632707994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11792803583037338851.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11377633738619439519.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality11377633738619439519.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :102 after 200
Reachability property apf3 is true.
Reachability property apf2 is true.
Reachability property apf1 is true.
Reachability property apf0 is true.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :200 after 797
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :797 after 81893
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :81893 after 848220
Detected timeout of ITS tools.
[2022-05-20 08:45:30] [INFO ] Flatten gal took : 127 ms
[2022-05-20 08:45:30] [INFO ] Applying decomposition
[2022-05-20 08:45:30] [INFO ] Flatten gal took : 111 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/graph4762724247778614892.txt' '-o' '/tmp/graph4762724247778614892.bin' '-w' '/tmp/graph4762724247778614892.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4762724247778614892.bin' '-l' '-1' '-v' '-w' '/tmp/graph4762724247778614892.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:45:31] [INFO ] Decomposing Gal with order
[2022-05-20 08:45:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:45:31] [INFO ] Removed a total of 590 redundant transitions.
[2022-05-20 08:45:31] [INFO ] Flatten gal took : 129 ms
[2022-05-20 08:45:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 258 ms.
[2022-05-20 08:45:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13551578853119322172.gal : 13 ms
[2022-05-20 08:45:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10328942146764582320.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms18042102833632707994;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13551578853119322172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10328942146764582320.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...300
Loading property file /tmp/ReachabilityCardinality10328942146764582320.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 107667
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :107667 after 107667
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :107667 after 107667
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8992266788955412759
[2022-05-20 08:45:46] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8992266788955412759
Running compilation step : cd /tmp/ltsmin8992266788955412759;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8992266788955412759;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8992266788955412759;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 248 ms. Reduced automaton from 5 states, 15 edges and 2 AP to 5 states, 15 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 145 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 147 ms :[p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 0 reset in 1335 ms.
Product exploration explored 100000 steps with 0 reset in 1786 ms.
Built C files in :
/tmp/ltsmin18099529011384637669
[2022-05-20 08:45:54] [INFO ] Too many transitions (1800) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:45:54] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18099529011384637669
Running compilation step : cd /tmp/ltsmin18099529011384637669;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18099529011384637669;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18099529011384637669;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 84 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:45:57] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:45:58] [INFO ] Implicit Places using invariants in 1211 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:45:58] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 08:45:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:46:00] [INFO ] Implicit Places using invariants and state equation in 1714 ms returned []
Implicit Place search using SMT with State Equation took 2925 ms to find 0 implicit places.
[2022-05-20 08:46:00] [INFO ] Redundant transitions in 35 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:46:00] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:46:01] [INFO ] Dead Transitions using invariants and state equation in 1073 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Built C files in :
/tmp/ltsmin16981782625971727643
[2022-05-20 08:46:01] [INFO ] Too many transitions (1800) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:46:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16981782625971727643
Running compilation step : cd /tmp/ltsmin16981782625971727643;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16981782625971727643;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16981782625971727643;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 08:46:04] [INFO ] Flatten gal took : 132 ms
[2022-05-20 08:46:04] [INFO ] Flatten gal took : 105 ms
[2022-05-20 08:46:04] [INFO ] Time to serialize gal into /tmp/LTL4369121034320345988.gal : 6 ms
[2022-05-20 08:46:05] [INFO ] Time to serialize properties into /tmp/LTL1971833108223293997.ltl : 340 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/LTL4369121034320345988.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1971833108223293997.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/LTL4369121...266
Read 1 LTL properties
Checking formula 0 : !((F(G(F(("((p243==1)&&(p250==1))")U(!((F(X(F(X("((p7==1)&&(p9==1))")))))U("((p243==1)&&(p250==1))"))))))))
Formula 0 simplified : !FGF("((p243==1)&&(p250==1))" U !(FXFX"((p7==1)&&(p9==1))" U "((p243==1)&&(p250==1))"))
Detected timeout of ITS tools.
[2022-05-20 08:46:20] [INFO ] Flatten gal took : 109 ms
[2022-05-20 08:46:20] [INFO ] Applying decomposition
[2022-05-20 08:46:20] [INFO ] Flatten gal took : 125 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/graph777852680481553827.txt' '-o' '/tmp/graph777852680481553827.bin' '-w' '/tmp/graph777852680481553827.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph777852680481553827.bin' '-l' '-1' '-v' '-w' '/tmp/graph777852680481553827.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:46:20] [INFO ] Decomposing Gal with order
[2022-05-20 08:46:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:46:20] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-20 08:46:20] [INFO ] Flatten gal took : 92 ms
[2022-05-20 08:46:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 178 ms.
[2022-05-20 08:46:21] [INFO ] Time to serialize gal into /tmp/LTL15974924945161521257.gal : 11 ms
[2022-05-20 08:46:21] [INFO ] Time to serialize properties into /tmp/LTL7348800519222695797.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/LTL15974924945161521257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7348800519222695797.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/LTL1597492...246
Read 1 LTL properties
Checking formula 0 : !((F(G(F(("((i2.i1.i2.i2.u76.p243==1)&&(i2.i1.i2.i1.u79.p250==1))")U(!((F(X(F(X("((i0.u2.p7==1)&&(i0.u2.p9==1))")))))U("((i2.i1.i2.i2....204
Formula 0 simplified : !FGF("((i2.i1.i2.i2.u76.p243==1)&&(i2.i1.i2.i1.u79.p250==1))" U !(FXFX"((i0.u2.p7==1)&&(i0.u2.p9==1))" U "((i2.i1.i2.i2.u76.p243==1)...186
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10348240887399475220
[2022-05-20 08:46:36] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10348240887399475220
Running compilation step : cd /tmp/ltsmin10348240887399475220;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10348240887399475220;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10348240887399475220;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-15 finished in 239803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(X(p1)||p0) U X(G(!X(F(p2))))))'
Found a SL insensitive property : ShieldPPPt-PT-100A-LTLFireability-09
Stuttering acceptance computed with spot in 156 ms :[p2, (AND p1 p2), p2, true, p2]
Support contains 6 out of 2503 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2503/2503 places, 1802/1802 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2501 transition count 1800
Applied a total of 4 rules in 202 ms. Remains 2501 /2503 variables (removed 2) and now considering 1800/1802 (removed 2) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:46:39] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:46:40] [INFO ] Implicit Places using invariants in 1206 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:46:40] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:46:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:46:42] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2861 ms to find 0 implicit places.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:46:42] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:46:43] [INFO ] Dead Transitions using invariants and state equation in 1074 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 2501/2503 places, 1800/1802 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2503 places, 1800/1802 transitions.
Running random walk in product with property : ShieldPPPt-PT-100A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(AND (EQ s387 1) (EQ s389 1)), p2:(AND (EQ s231 1) (EQ s246 1)), p0:(OR (NOT (AND (EQ s387 1) (EQ s389 1))) (AND (EQ s1817 1) (EQ s1819 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1332 ms.
Product exploration explored 100000 steps with 0 reset in 1700 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 414 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 113 ms :[true, p2, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152008 steps, run timeout after 3004 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152008 steps, saw 150230 distinct states, run finished after 3005 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:46:50] [INFO ] Computed 1101 place invariants in 12 ms
[2022-05-20 08:46:51] [INFO ] [Real]Absence check using 1101 positive place invariants in 204 ms returned sat
[2022-05-20 08:46:52] [INFO ] After 1651ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:46:52] [INFO ] [Nat]Absence check using 1101 positive place invariants in 202 ms returned sat
[2022-05-20 08:46:55] [INFO ] After 2240ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:46:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:46:55] [INFO ] After 103ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:46:55] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-20 08:46:55] [INFO ] After 3243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 218 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 0 with 399 rules applied. Total rules applied 399 place count 2501 transition count 1800
Applied a total of 399 rules in 154 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 127425 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127425 steps, saw 122046 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:46:59] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 08:46:59] [INFO ] [Real]Absence check using 1101 positive place invariants in 199 ms returned sat
[2022-05-20 08:47:00] [INFO ] After 1780ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:47:01] [INFO ] [Nat]Absence check using 1101 positive place invariants in 195 ms returned sat
[2022-05-20 08:47:02] [INFO ] After 1460ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:47:02] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:47:04] [INFO ] After 1744ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:47:04] [INFO ] After 1914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2022-05-20 08:47:04] [INFO ] After 4072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 134 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 74 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 75 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:05] [INFO ] Computed 1101 place invariants in 10 ms
[2022-05-20 08:47:06] [INFO ] Implicit Places using invariants in 1279 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:06] [INFO ] Computed 1101 place invariants in 5 ms
[2022-05-20 08:47:07] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:47:08] [INFO ] Implicit Places using invariants and state equation in 1960 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2022-05-20 08:47:08] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:08] [INFO ] Computed 1101 place invariants in 8 ms
[2022-05-20 08:47:09] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Graph (complete) has 7293 edges and 2501 vertex of which 2500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 2498 transition count 1798
Partial Free-agglomeration rule applied 100 times.
Drop transitions removed 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 105 place count 2498 transition count 1798
Drop transitions removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 0 with 100 rules applied. Total rules applied 205 place count 2498 transition count 1698
Applied a total of 205 rules in 244 ms. Remains 2498 /2501 variables (removed 3) and now considering 1698/1800 (removed 102) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1698 rows 2498 cols
[2022-05-20 08:47:09] [INFO ] Computed 1100 place invariants in 3 ms
[2022-05-20 08:47:10] [INFO ] [Real]Absence check using 1100 positive place invariants in 193 ms returned sat
[2022-05-20 08:47:11] [INFO ] After 1803ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:47:12] [INFO ] [Nat]Absence check using 1100 positive place invariants in 192 ms returned sat
[2022-05-20 08:47:14] [INFO ] After 2521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:47:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:47:14] [INFO ] After 111ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:47:15] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 110 ms.
[2022-05-20 08:47:15] [INFO ] After 3490ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:47:15] [INFO ] Flatten gal took : 110 ms
[2022-05-20 08:47:15] [INFO ] Flatten gal took : 109 ms
[2022-05-20 08:47:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2224897428598017258.gal : 6 ms
[2022-05-20 08:47:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12448758075636217900.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14887706523197780916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2224897428598017258.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12448758075636217900.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality12448758075636217900.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :2 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 14
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :14 after 27
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :27 after 53
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :53 after 102
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :102 after 200
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :200 after 997
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :997 after 614431
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :614431 after 1.13494e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.13494e+07 after 6.66589e+09
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :6.66589e+09 after 1.21679e+13
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1.21679e+13 after 5.33793e+16
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :5.33793e+16 after 7.02596e+20
Detected timeout of ITS tools.
[2022-05-20 08:47:30] [INFO ] Flatten gal took : 108 ms
[2022-05-20 08:47:30] [INFO ] Applying decomposition
[2022-05-20 08:47:30] [INFO ] Flatten gal took : 106 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/graph4629982641555981604.txt' '-o' '/tmp/graph4629982641555981604.bin' '-w' '/tmp/graph4629982641555981604.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4629982641555981604.bin' '-l' '-1' '-v' '-w' '/tmp/graph4629982641555981604.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:47:30] [INFO ] Decomposing Gal with order
[2022-05-20 08:47:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:47:30] [INFO ] Removed a total of 592 redundant transitions.
[2022-05-20 08:47:31] [INFO ] Flatten gal took : 93 ms
[2022-05-20 08:47:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 184 ms.
[2022-05-20 08:47:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2135590150189227345.gal : 473 ms
[2022-05-20 08:47:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16025303845401867395.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14887706523197780916;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2135590150189227345.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16025303845401867395.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality16025303845401867395.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 146
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :146 after 146
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :146 after 1.4295e+23
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9793455645218452662
[2022-05-20 08:47:46] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9793455645218452662
Running compilation step : cd /tmp/ltsmin9793455645218452662;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9793455645218452662;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9793455645218452662;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 404 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 99 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 114 ms :[true, p2, p2, p2]
Support contains 2 out of 2501 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 71 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:50] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:47:51] [INFO ] Implicit Places using invariants in 1255 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:51] [INFO ] Computed 1101 place invariants in 13 ms
[2022-05-20 08:47:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:47:53] [INFO ] Implicit Places using invariants and state equation in 1770 ms returned []
Implicit Place search using SMT with State Equation took 3028 ms to find 0 implicit places.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:53] [INFO ] Computed 1101 place invariants in 9 ms
[2022-05-20 08:47:54] [INFO ] Dead Transitions using invariants and state equation in 1070 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p2), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 111 ms :[true, p2, p2, p2]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 155303 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 155303 steps, saw 153492 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:47:58] [INFO ] Computed 1101 place invariants in 7 ms
[2022-05-20 08:47:58] [INFO ] [Real]Absence check using 1101 positive place invariants in 209 ms returned sat
[2022-05-20 08:47:59] [INFO ] After 1698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:48:00] [INFO ] [Nat]Absence check using 1101 positive place invariants in 206 ms returned sat
[2022-05-20 08:48:02] [INFO ] After 2367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:48:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:48:02] [INFO ] After 105ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:48:03] [INFO ] After 263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-20 08:48:03] [INFO ] After 3369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 143 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Partial Free-agglomeration rule applied 399 times.
Drop transitions removed 399 transitions
Iterating global reduction 0 with 399 rules applied. Total rules applied 399 place count 2501 transition count 1800
Applied a total of 399 rules in 181 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 136326 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 136326 steps, saw 130543 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:48:06] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:48:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 200 ms returned sat
[2022-05-20 08:48:08] [INFO ] After 1667ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:48:08] [INFO ] [Nat]Absence check using 1101 positive place invariants in 203 ms returned sat
[2022-05-20 08:48:10] [INFO ] After 1477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:48:10] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-05-20 08:48:12] [INFO ] After 1725ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:48:12] [INFO ] After 1877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-05-20 08:48:12] [INFO ] After 4064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 140 ms.
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 75 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 86 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:48:12] [INFO ] Computed 1101 place invariants in 11 ms
[2022-05-20 08:48:14] [INFO ] Implicit Places using invariants in 1954 ms returned [2494]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1972 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 2500/2501 places, 1800/1800 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 2500 transition count 1798
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 2498 transition count 1798
Applied a total of 4 rules in 88 ms. Remains 2498 /2500 variables (removed 2) and now considering 1798/1800 (removed 2) transitions.
// Phase 1: matrix 1798 rows 2498 cols
[2022-05-20 08:48:14] [INFO ] Computed 1100 place invariants in 8 ms
[2022-05-20 08:48:16] [INFO ] Implicit Places using invariants in 1851 ms returned [2481, 2485]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1853 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 2496/2501 places, 1798/1800 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2494 transition count 1796
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2494 transition count 1796
Applied a total of 4 rules in 187 ms. Remains 2494 /2496 variables (removed 2) and now considering 1796/1798 (removed 2) transitions.
// Phase 1: matrix 1796 rows 2494 cols
[2022-05-20 08:48:16] [INFO ] Computed 1098 place invariants in 5 ms
[2022-05-20 08:48:18] [INFO ] Implicit Places using invariants in 1390 ms returned []
// Phase 1: matrix 1796 rows 2494 cols
[2022-05-20 08:48:18] [INFO ] Computed 1098 place invariants in 11 ms
[2022-05-20 08:48:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-20 08:48:24] [INFO ] Implicit Places using invariants and state equation in 6099 ms returned []
Implicit Place search using SMT with State Equation took 7496 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 2494/2501 places, 1796/1800 transitions.
Finished structural reductions, in 3 iterations. Remains : 2494/2501 places, 1796/1800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 138362 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138362 steps, saw 132009 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1796 rows 2494 cols
[2022-05-20 08:48:27] [INFO ] Computed 1098 place invariants in 7 ms
[2022-05-20 08:48:28] [INFO ] [Real]Absence check using 1098 positive place invariants in 202 ms returned sat
[2022-05-20 08:48:29] [INFO ] After 1617ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 08:48:29] [INFO ] [Nat]Absence check using 1098 positive place invariants in 201 ms returned sat
[2022-05-20 08:48:31] [INFO ] After 1896ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 08:48:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2022-05-20 08:48:32] [INFO ] After 787ms SMT Verify possible using 100 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 08:48:32] [INFO ] After 1004ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 148 ms.
[2022-05-20 08:48:32] [INFO ] After 3592ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2164 steps, including 0 resets, run visited all 1 properties in 35 ms. (steps per millisecond=61 )
Parikh walk visited 1 properties in 34 ms.
Knowledge obtained : [(NOT p2), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 1 AP to 4 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 112 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 102 ms :[true, p2, p2, p2]
Stuttering acceptance computed with spot in 111 ms :[true, p2, p2, p2]
Product exploration explored 100000 steps with 0 reset in 1287 ms.
Product exploration explored 100000 steps with 0 reset in 1693 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 127 ms :[true, p2, p2, p2]
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 96 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
[2022-05-20 08:48:36] [INFO ] Redundant transitions in 36 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:48:36] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:48:37] [INFO ] Dead Transitions using invariants and state equation in 1079 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Product exploration explored 100000 steps with 0 reset in 1310 ms.
Product exploration explored 100000 steps with 0 reset in 1699 ms.
Built C files in :
/tmp/ltsmin9244033803019836210
[2022-05-20 08:48:40] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9244033803019836210
Running compilation step : cd /tmp/ltsmin9244033803019836210;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9244033803019836210;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9244033803019836210;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 2501 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2501/2501 places, 1800/1800 transitions.
Applied a total of 0 rules in 78 ms. Remains 2501 /2501 variables (removed 0) and now considering 1800/1800 (removed 0) transitions.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:48:43] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:48:45] [INFO ] Implicit Places using invariants in 1615 ms returned []
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:48:45] [INFO ] Computed 1101 place invariants in 3 ms
[2022-05-20 08:48:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-20 08:48:47] [INFO ] Implicit Places using invariants and state equation in 1644 ms returned []
Implicit Place search using SMT with State Equation took 3282 ms to find 0 implicit places.
// Phase 1: matrix 1800 rows 2501 cols
[2022-05-20 08:48:47] [INFO ] Computed 1101 place invariants in 4 ms
[2022-05-20 08:48:48] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2501/2501 places, 1800/1800 transitions.
Built C files in :
/tmp/ltsmin827841726517263958
[2022-05-20 08:48:48] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin827841726517263958
Running compilation step : cd /tmp/ltsmin827841726517263958;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin827841726517263958;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin827841726517263958;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 08:48:51] [INFO ] Flatten gal took : 110 ms
[2022-05-20 08:48:51] [INFO ] Flatten gal took : 113 ms
[2022-05-20 08:48:51] [INFO ] Time to serialize gal into /tmp/LTL7696274517650520655.gal : 5 ms
[2022-05-20 08:48:51] [INFO ] Time to serialize properties into /tmp/LTL17635802787713551120.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/LTL7696274517650520655.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17635802787713551120.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/LTL7696274...267
Read 1 LTL properties
Checking formula 0 : !(((!(((X("((p387==1)&&(p389==1))"))||(!("((p387==1)&&(p389==1))")))||("((p1817==1)&&(p1819==1))")))U(X(G(!(X(F("((p231==1)&&(p246==1)...165
Formula 0 simplified : !(!(!"((p387==1)&&(p389==1))" | "((p1817==1)&&(p1819==1))" | X"((p387==1)&&(p389==1))") U XG!XF"((p231==1)&&(p246==1))")
Detected timeout of ITS tools.
[2022-05-20 08:49:06] [INFO ] Flatten gal took : 107 ms
[2022-05-20 08:49:06] [INFO ] Applying decomposition
[2022-05-20 08:49:06] [INFO ] Flatten gal took : 108 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/graph11281534713239457598.txt' '-o' '/tmp/graph11281534713239457598.bin' '-w' '/tmp/graph11281534713239457598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11281534713239457598.bin' '-l' '-1' '-v' '-w' '/tmp/graph11281534713239457598.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:49:07] [INFO ] Decomposing Gal with order
[2022-05-20 08:49:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:49:07] [INFO ] Removed a total of 299 redundant transitions.
[2022-05-20 08:49:07] [INFO ] Flatten gal took : 83 ms
[2022-05-20 08:49:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 171 ms.
[2022-05-20 08:49:07] [INFO ] Time to serialize gal into /tmp/LTL9411502966962411388.gal : 14 ms
[2022-05-20 08:49:07] [INFO ] Time to serialize properties into /tmp/LTL14297109554625786330.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/LTL9411502966962411388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14297109554625786330.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/LTL9411502...246
Read 1 LTL properties
Checking formula 0 : !(((!(((X("((i6.i0.i1.i0.u123.p387==1)&&(i6.i0.i1.i0.u123.p389==1))"))||(!("((i6.i0.i1.i0.u123.p387==1)&&(i6.i0.i1.i0.u123.p389==1))")...283
Formula 0 simplified : !(!(!"((i6.i0.i1.i0.u123.p387==1)&&(i6.i0.i1.i0.u123.p389==1))" | "((i26.i1.i1.i0.u580.p1817==1)&&(i26.i1.i1.i0.u580.p1819==1))" | X...261
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6884198922830622657
[2022-05-20 08:49:22] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6884198922830622657
Running compilation step : cd /tmp/ltsmin6884198922830622657;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6884198922830622657;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6884198922830622657;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ShieldPPPt-PT-100A-LTLFireability-09 finished in 166279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F((p0 U !(F(X(F(X(p1)))) U p0))))))'
[2022-05-20 08:49:25] [INFO ] Flatten gal took : 107 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6303496782195198444
[2022-05-20 08:49:25] [INFO ] Too many transitions (1802) to apply POR reductions. Disabling POR matrices.
[2022-05-20 08:49:25] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6303496782195198444
Running compilation step : cd /tmp/ltsmin6303496782195198444;'/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'
[2022-05-20 08:49:25] [INFO ] Applying decomposition
[2022-05-20 08:49:25] [INFO ] Flatten gal took : 115 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/graph191627914091945855.txt' '-o' '/tmp/graph191627914091945855.bin' '-w' '/tmp/graph191627914091945855.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph191627914091945855.bin' '-l' '-1' '-v' '-w' '/tmp/graph191627914091945855.weights' '-q' '0' '-e' '0.001'
[2022-05-20 08:49:26] [INFO ] Decomposing Gal with order
[2022-05-20 08:49:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 08:49:26] [INFO ] Removed a total of 300 redundant transitions.
[2022-05-20 08:49:26] [INFO ] Flatten gal took : 95 ms
[2022-05-20 08:49:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 165 ms.
[2022-05-20 08:49:26] [INFO ] Time to serialize gal into /tmp/LTLFireability4493128638395730989.gal : 19 ms
[2022-05-20 08:49:26] [INFO ] Time to serialize properties into /tmp/LTLFireability15582581196131705129.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/LTLFireability4493128638395730989.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15582581196131705129.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/LTLFireabi...268
Read 3 LTL properties
Checking formula 0 : !((F((G("((i0.u10.p32!=1)||(i0.u10.p34!=1))"))||(G("(i25.i1.i0.i1.u582.p1822!=1)")))))
Formula 0 simplified : !F(G"((i0.u10.p32!=1)||(i0.u10.p34!=1))" | G"(i25.i1.i0.i1.u582.p1822!=1)")
Compilation finished in 4035 ms.
Running link step : cd /tmp/ltsmin6303496782195198444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 122 ms.
Running LTSmin : cd /tmp/ltsmin6303496782195198444;'/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 exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.024: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.033: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.033: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.032: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.032: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.043: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.043: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.121: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.237: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.248: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.263: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.261: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.272: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.272: Initializing POR dependencies: labels 1809, guards 1802
pins2lts-mc-linux64( 2/ 8), 0.273: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 83.609: No maybe-coenabled matrix found. Turning off NESs from NDS+MC.
pins2lts-mc-linux64( 5/ 8), 267.298: LTL layer: formula: <>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))
pins2lts-mc-linux64( 5/ 8), 267.298: "<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 267.299: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 271.232: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 271.293: There are 1810 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 271.293: State length is 2504, there are 1810 groups
pins2lts-mc-linux64( 0/ 8), 271.293: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 271.293: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 271.293: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 271.293: Visible groups: 0 / 1810, labels: 2 / 1810
pins2lts-mc-linux64( 0/ 8), 271.293: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 271.293: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 271.527: [Blue] ~118 levels ~960 states ~3664 transitions
pins2lts-mc-linux64( 6/ 8), 271.779: [Blue] ~238 levels ~1920 states ~7344 transitions
pins2lts-mc-linux64( 6/ 8), 272.239: [Blue] ~472 levels ~3840 states ~15608 transitions
pins2lts-mc-linux64( 6/ 8), 273.224: [Blue] ~947 levels ~7680 states ~35800 transitions
pins2lts-mc-linux64( 7/ 8), 275.005: [Blue] ~1908 levels ~15360 states ~75560 transitions
pins2lts-mc-linux64( 7/ 8), 278.352: [Blue] ~3815 levels ~30720 states ~160200 transitions
pins2lts-mc-linux64( 7/ 8), 285.841: [Blue] ~7629 levels ~61440 states ~335232 transitions
pins2lts-mc-linux64( 6/ 8), 302.102: [Blue] ~15189 levels ~122880 states ~669440 transitions
pins2lts-mc-linux64( 6/ 8), 329.162: [Blue] ~30375 levels ~245760 states ~1383840 transitions
pins2lts-mc-linux64( 6/ 8), 383.935: [Blue] ~60692 levels ~491520 states ~2861608 transitions
pins2lts-mc-linux64( 6/ 8), 492.911: [Blue] ~121419 levels ~983040 states ~5951128 transitions
pins2lts-mc-linux64( 6/ 8), 712.473: [Blue] ~242963 levels ~1966080 states ~12395536 transitions
pins2lts-mc-linux64( 1/ 8), 831.606: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 831.908:
pins2lts-mc-linux64( 0/ 8), 831.908: Explored 2208314 states 16680351 transitions, fanout: 7.553
pins2lts-mc-linux64( 0/ 8), 831.908: Total exploration time 560.600 sec (560.360 sec minimum, 560.456 sec on average)
pins2lts-mc-linux64( 0/ 8), 831.908: States per second: 3939, Transitions per second: 29754
pins2lts-mc-linux64( 0/ 8), 831.908:
pins2lts-mc-linux64( 0/ 8), 831.908: State space has 8731540 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 831.908: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 831.908: blue states: 2208314 (25.29%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 831.908: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 831.908: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 831.909:
pins2lts-mc-linux64( 0/ 8), 831.909: Total memory used for local state coloring: 33.5MB
pins2lts-mc-linux64( 0/ 8), 831.909:
pins2lts-mc-linux64( 0/ 8), 831.909: Queue width: 8B, total height: 2198170, memory: 16.77MB
pins2lts-mc-linux64( 0/ 8), 831.909: Tree memory: 322.6MB, 38.7 B/state, compr.: 0.4%
pins2lts-mc-linux64( 0/ 8), 831.909: Tree fill ratio (roots/leafs): 6.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 831.909: Stored 1829 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 831.909: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 831.909: Est. total memory use: 339.4MB (~1040.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6303496782195198444;'/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'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6303496782195198444;'/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'
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 09:14:56] [INFO ] Applying decomposition
[2022-05-20 09:14:57] [INFO ] Flatten gal took : 110 ms
[2022-05-20 09:14:57] [INFO ] Decomposing Gal with order
[2022-05-20 09:14:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 09:14:57] [INFO ] Removed a total of 600 redundant transitions.
[2022-05-20 09:14:57] [INFO ] Flatten gal took : 101 ms
[2022-05-20 09:14:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 58 ms.
[2022-05-20 09:14:57] [INFO ] Time to serialize gal into /tmp/LTLFireability4699460236312756525.gal : 17 ms
[2022-05-20 09:14:57] [INFO ] Time to serialize properties into /tmp/LTLFireability1262625560992789172.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/LTLFireability4699460236312756525.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1262625560992789172.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/LTLFireabi...267
Read 3 LTL properties
Checking formula 0 : !((F((G("((i10.u18.p32!=1)||(i10.u19.p34!=1))"))||(G("(u1021.p1822!=1)")))))
Formula 0 simplified : !F(G"((i10.u18.p32!=1)||(i10.u19.p34!=1))" | G"(u1021.p1822!=1)")
ITS-tools command line returned an error code 137
[2022-05-20 09:28:02] [INFO ] Flatten gal took : 805 ms
[2022-05-20 09:28:04] [INFO ] Input system was already deterministic with 1802 transitions.
[2022-05-20 09:28:04] [INFO ] Transformed 2503 places.
[2022-05-20 09:28:04] [INFO ] Transformed 1802 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 09:28:05] [INFO ] Time to serialize gal into /tmp/LTLFireability5326466718588884223.gal : 9 ms
[2022-05-20 09:28:05] [INFO ] Time to serialize properties into /tmp/LTLFireability10395738968989944039.ltl : 4 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/LTLFireability5326466718588884223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10395738968989944039.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/LTLFireabi...334
Read 3 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G("((p32!=1)||(p34!=1))"))||(G("(p1822!=1)")))))
Formula 0 simplified : !F(G"((p32!=1)||(p34!=1))" | G"(p1822!=1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ShieldPPPt-PT-100A"
export BK_EXAMINATION="LTLFireability"
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 ShieldPPPt-PT-100A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r222-tall-165286025600692"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-100A.tgz
mv ShieldPPPt-PT-100A execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;