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-165286025300492.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ShieldPPPs-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025300492
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 5.9K Apr 30 03:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 03:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 03:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 03:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 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 708K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-00
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-01
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-02
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-03
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-04
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-05
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-06
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-07
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-08
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-09
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-10
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-11
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-12
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-13
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-14
FORMULA_NAME ShieldPPPs-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653002739788

Running Version 202205111006
[2022-05-19 23:25:40] [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-19 23:25:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 23:25:41] [INFO ] Load time of PNML (sax parser for PT used): 205 ms
[2022-05-19 23:25:41] [INFO ] Transformed 2723 places.
[2022-05-19 23:25:41] [INFO ] Transformed 2523 transitions.
[2022-05-19 23:25:41] [INFO ] Found NUPN structural information;
[2022-05-19 23:25:41] [INFO ] Parsed PT model containing 2723 places and 2523 transitions in 409 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.
FORMULA ShieldPPPs-PT-040B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-040B-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 2723 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2723/2723 places, 2523/2523 transitions.
Discarding 276 places :
Symmetric choice reduction at 0 with 276 rule applications. Total rules 276 place count 2447 transition count 2247
Iterating global reduction 0 with 276 rules applied. Total rules applied 552 place count 2447 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 553 place count 2446 transition count 2246
Iterating global reduction 0 with 1 rules applied. Total rules applied 554 place count 2446 transition count 2246
Applied a total of 554 rules in 847 ms. Remains 2446 /2723 variables (removed 277) and now considering 2246/2523 (removed 277) transitions.
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:25:42] [INFO ] Computed 441 place invariants in 37 ms
[2022-05-19 23:25:43] [INFO ] Implicit Places using invariants in 1060 ms returned []
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:25:43] [INFO ] Computed 441 place invariants in 17 ms
[2022-05-19 23:25:46] [INFO ] Implicit Places using invariants and state equation in 2451 ms returned []
Implicit Place search using SMT with State Equation took 3644 ms to find 0 implicit places.
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:25:46] [INFO ] Computed 441 place invariants in 15 ms
[2022-05-19 23:25:47] [INFO ] Dead Transitions using invariants and state equation in 1398 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2446/2723 places, 2246/2523 transitions.
Finished structural reductions, in 1 iterations. Remains : 2446/2723 places, 2246/2523 transitions.
Support contains 34 out of 2446 places after structural reductions.
[2022-05-19 23:25:47] [INFO ] Flatten gal took : 175 ms
[2022-05-19 23:25:48] [INFO ] Flatten gal took : 108 ms
[2022-05-19 23:25:48] [INFO ] Input system was already deterministic with 2246 transitions.
Support contains 33 out of 2446 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=18 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2246 rows 2446 cols
[2022-05-19 23:25:48] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-19 23:25:49] [INFO ] [Real]Absence check using 441 positive place invariants in 155 ms returned sat
[2022-05-19 23:25:49] [INFO ] After 707ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-19 23:25:50] [INFO ] [Nat]Absence check using 441 positive place invariants in 162 ms returned sat
[2022-05-19 23:25:51] [INFO ] After 1336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-19 23:25:52] [INFO ] Deduced a trap composed of 28 places in 616 ms of which 6 ms to minimize.
[2022-05-19 23:25:53] [INFO ] Deduced a trap composed of 28 places in 600 ms of which 3 ms to minimize.
[2022-05-19 23:25:53] [INFO ] Deduced a trap composed of 25 places in 558 ms of which 2 ms to minimize.
[2022-05-19 23:25:54] [INFO ] Deduced a trap composed of 23 places in 513 ms of which 3 ms to minimize.
[2022-05-19 23:25:54] [INFO ] Deduced a trap composed of 19 places in 481 ms of which 2 ms to minimize.
[2022-05-19 23:25:55] [INFO ] Deduced a trap composed of 23 places in 544 ms of which 1 ms to minimize.
[2022-05-19 23:25:56] [INFO ] Deduced a trap composed of 20 places in 519 ms of which 2 ms to minimize.
[2022-05-19 23:25:56] [INFO ] Deduced a trap composed of 33 places in 520 ms of which 2 ms to minimize.
[2022-05-19 23:25:57] [INFO ] Deduced a trap composed of 18 places in 485 ms of which 2 ms to minimize.
[2022-05-19 23:25:57] [INFO ] Deduced a trap composed of 16 places in 517 ms of which 1 ms to minimize.
[2022-05-19 23:25:58] [INFO ] Deduced a trap composed of 25 places in 466 ms of which 1 ms to minimize.
[2022-05-19 23:25:58] [INFO ] Deduced a trap composed of 23 places in 478 ms of which 1 ms to minimize.
[2022-05-19 23:25:59] [INFO ] Deduced a trap composed of 37 places in 489 ms of which 1 ms to minimize.
[2022-05-19 23:26:00] [INFO ] Deduced a trap composed of 41 places in 490 ms of which 2 ms to minimize.
[2022-05-19 23:26:00] [INFO ] Deduced a trap composed of 31 places in 493 ms of which 1 ms to minimize.
[2022-05-19 23:26:01] [INFO ] Deduced a trap composed of 32 places in 455 ms of which 1 ms to minimize.
[2022-05-19 23:26:01] [INFO ] Deduced a trap composed of 30 places in 494 ms of which 1 ms to minimize.
[2022-05-19 23:26:02] [INFO ] Deduced a trap composed of 31 places in 471 ms of which 1 ms to minimize.
[2022-05-19 23:26:02] [INFO ] Deduced a trap composed of 32 places in 483 ms of which 1 ms to minimize.
[2022-05-19 23:26:03] [INFO ] Deduced a trap composed of 32 places in 450 ms of which 3 ms to minimize.
[2022-05-19 23:26:03] [INFO ] Deduced a trap composed of 31 places in 461 ms of which 1 ms to minimize.
[2022-05-19 23:26:04] [INFO ] Deduced a trap composed of 40 places in 464 ms of which 1 ms to minimize.
[2022-05-19 23:26:05] [INFO ] Deduced a trap composed of 34 places in 455 ms of which 1 ms to minimize.
[2022-05-19 23:26:05] [INFO ] Deduced a trap composed of 29 places in 471 ms of which 1 ms to minimize.
[2022-05-19 23:26:06] [INFO ] Deduced a trap composed of 28 places in 489 ms of which 1 ms to minimize.
[2022-05-19 23:26:06] [INFO ] Deduced a trap composed of 35 places in 491 ms of which 1 ms to minimize.
[2022-05-19 23:26:07] [INFO ] Deduced a trap composed of 20 places in 493 ms of which 1 ms to minimize.
[2022-05-19 23:26:07] [INFO ] Deduced a trap composed of 53 places in 481 ms of which 1 ms to minimize.
[2022-05-19 23:26:08] [INFO ] Deduced a trap composed of 20 places in 480 ms of which 1 ms to minimize.
[2022-05-19 23:26:08] [INFO ] Deduced a trap composed of 18 places in 454 ms of which 1 ms to minimize.
[2022-05-19 23:26:09] [INFO ] Deduced a trap composed of 27 places in 471 ms of which 1 ms to minimize.
[2022-05-19 23:26:10] [INFO ] Deduced a trap composed of 38 places in 454 ms of which 1 ms to minimize.
[2022-05-19 23:26:10] [INFO ] Deduced a trap composed of 37 places in 432 ms of which 1 ms to minimize.
[2022-05-19 23:26:11] [INFO ] Deduced a trap composed of 53 places in 499 ms of which 2 ms to minimize.
[2022-05-19 23:26:11] [INFO ] Deduced a trap composed of 44 places in 452 ms of which 1 ms to minimize.
[2022-05-19 23:26:12] [INFO ] Deduced a trap composed of 44 places in 467 ms of which 1 ms to minimize.
[2022-05-19 23:26:12] [INFO ] Deduced a trap composed of 41 places in 448 ms of which 1 ms to minimize.
[2022-05-19 23:26:13] [INFO ] Deduced a trap composed of 50 places in 439 ms of which 1 ms to minimize.
[2022-05-19 23:26:13] [INFO ] Deduced a trap composed of 40 places in 452 ms of which 6 ms to minimize.
[2022-05-19 23:26:14] [INFO ] Deduced a trap composed of 42 places in 447 ms of which 2 ms to minimize.
[2022-05-19 23:26:14] [INFO ] Deduced a trap composed of 32 places in 457 ms of which 1 ms to minimize.
[2022-05-19 23:26:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:26:14] [INFO ] After 25279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 367 ms.
Support contains 7 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2446 transition count 1966
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 2166 transition count 1965
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 2165 transition count 1965
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 562 place count 2165 transition count 1765
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 962 place count 1965 transition count 1765
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 965 place count 1962 transition count 1762
Iterating global reduction 3 with 3 rules applied. Total rules applied 968 place count 1962 transition count 1762
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 968 place count 1962 transition count 1761
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 970 place count 1961 transition count 1761
Performed 715 Post agglomeration using F-continuation condition.Transition count delta: 715
Deduced a syphon composed of 715 places in 3 ms
Reduce places removed 715 places and 0 transitions.
Iterating global reduction 3 with 1430 rules applied. Total rules applied 2400 place count 1246 transition count 1046
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 355 times.
Drop transitions removed 355 transitions
Iterating global reduction 3 with 355 rules applied. Total rules applied 2755 place count 1246 transition count 1046
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2756 place count 1245 transition count 1045
Applied a total of 2756 rules in 1134 ms. Remains 1245 /2446 variables (removed 1201) and now considering 1045/2246 (removed 1201) transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/2446 places, 1045/2246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:26:16] [INFO ] Computed 441 place invariants in 65 ms
[2022-05-19 23:26:16] [INFO ] [Real]Absence check using 419 positive place invariants in 61 ms returned sat
[2022-05-19 23:26:16] [INFO ] [Real]Absence check using 419 positive and 22 generalized place invariants in 3 ms returned sat
[2022-05-19 23:26:17] [INFO ] After 702ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:26:17] [INFO ] [Nat]Absence check using 419 positive place invariants in 65 ms returned sat
[2022-05-19 23:26:17] [INFO ] [Nat]Absence check using 419 positive and 22 generalized place invariants in 4 ms returned sat
[2022-05-19 23:26:18] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:26:18] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 1 ms to minimize.
[2022-05-19 23:26:18] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2022-05-19 23:26:18] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2022-05-19 23:26:18] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 1 ms to minimize.
[2022-05-19 23:26:18] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 1 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 1 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 1 ms to minimize.
[2022-05-19 23:26:19] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 2 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 5 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2022-05-19 23:26:20] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 2 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2022-05-19 23:26:21] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
[2022-05-19 23:26:22] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2022-05-19 23:26:23] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2022-05-19 23:26:23] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 0 ms to minimize.
[2022-05-19 23:26:23] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2022-05-19 23:26:23] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 5214 ms
[2022-05-19 23:26:23] [INFO ] After 5742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 23:26:23] [INFO ] After 6022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 1245 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1245/1245 places, 1045/1045 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1245 transition count 1044
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1244 transition count 1044
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1243 transition count 1043
Applied a total of 4 rules in 72 ms. Remains 1243 /1245 variables (removed 2) and now considering 1043/1045 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1245 places, 1043/1045 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Finished probabilistic random walk after 67700 steps, run visited all 1 properties in 1124 ms. (steps per millisecond=60 )
Probabilistic random walk after 67700 steps, saw 62714 distinct states, run finished after 1125 ms. (steps per millisecond=60 ) properties seen :1
Computed a total of 481 stabilizing places and 481 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(p0))))'
Support contains 1 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2164 transition count 1764
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1964 transition count 1764
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 966 place count 1960 transition count 1760
Iterating global reduction 2 with 4 rules applied. Total rules applied 970 place count 1960 transition count 1760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 970 place count 1960 transition count 1759
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2404 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 1241 transition count 1041
Applied a total of 2406 rules in 431 ms. Remains 1241 /2446 variables (removed 1205) and now considering 1041/2246 (removed 1205) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:25] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:26:26] [INFO ] Implicit Places using invariants in 560 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:26] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-19 23:26:27] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1651 ms to find 0 implicit places.
[2022-05-19 23:26:27] [INFO ] Redundant transitions in 65 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:27] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:26:27] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2446 places, 1041/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1241/2446 places, 1041/2246 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s816 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2625 steps with 0 reset in 43 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-00 finished in 2969 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U G(p1)) U !p2)))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2445 transition count 1966
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 2166 transition count 1966
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 558 place count 2166 transition count 1767
Deduced a syphon composed of 199 places in 3 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 956 place count 1967 transition count 1767
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 960 place count 1963 transition count 1763
Iterating global reduction 2 with 4 rules applied. Total rules applied 964 place count 1963 transition count 1763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 964 place count 1963 transition count 1762
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 966 place count 1962 transition count 1762
Performed 715 Post agglomeration using F-continuation condition.Transition count delta: 715
Deduced a syphon composed of 715 places in 2 ms
Reduce places removed 715 places and 0 transitions.
Iterating global reduction 2 with 1430 rules applied. Total rules applied 2396 place count 1247 transition count 1047
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2398 place count 1245 transition count 1045
Applied a total of 2398 rules in 408 ms. Remains 1245 /2446 variables (removed 1201) and now considering 1045/2246 (removed 1201) transitions.
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:26:28] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:26:29] [INFO ] Implicit Places using invariants in 597 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:26:29] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:26:30] [INFO ] Implicit Places using invariants and state equation in 1170 ms returned []
Implicit Place search using SMT with State Equation took 1770 ms to find 0 implicit places.
[2022-05-19 23:26:30] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 1045 rows 1245 cols
[2022-05-19 23:26:30] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:26:30] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1245/2446 places, 1045/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1245/2446 places, 1045/2246 transitions.
Stuttering acceptance computed with spot in 199 ms :[p2, true, (NOT p1), (NOT p1), p2]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s949 1) (EQ s967 1)), p1:(EQ s582 1), p0:(EQ s699 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 342 steps with 0 reset in 9 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-01 finished in 3043 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2164 transition count 1764
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1964 transition count 1764
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 966 place count 1960 transition count 1760
Iterating global reduction 2 with 4 rules applied. Total rules applied 970 place count 1960 transition count 1760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 970 place count 1960 transition count 1759
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2404 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2406 place count 1241 transition count 1041
Applied a total of 2406 rules in 374 ms. Remains 1241 /2446 variables (removed 1205) and now considering 1041/2246 (removed 1205) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:31] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:26:32] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:32] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:26:33] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2022-05-19 23:26:33] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:33] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:26:33] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1241/2446 places, 1041/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1241/2446 places, 1041/2246 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s687 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 96 reset in 905 ms.
Product exploration explored 100000 steps with 95 reset in 1085 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1143 steps, including 0 resets, run visited all 1 properties in 13 ms. (steps per millisecond=87 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:36] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:26:37] [INFO ] [Real]Absence check using 441 positive place invariants in 277 ms returned sat
[2022-05-19 23:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:26:40] [INFO ] [Real]Absence check using state equation in 2648 ms returned sat
[2022-05-19 23:26:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:26:41] [INFO ] [Nat]Absence check using 441 positive place invariants in 280 ms returned sat
[2022-05-19 23:26:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:26:44] [INFO ] [Nat]Absence check using state equation in 2800 ms returned sat
[2022-05-19 23:26:44] [INFO ] Computed and/alt/rep : 1039/1994/1039 causal constraints (skipped 0 transitions) in 52 ms.
[2022-05-19 23:26:55] [INFO ] Added : 565 causal constraints over 113 iterations in 11170 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 1 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 29 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:55] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:26:56] [INFO ] Implicit Places using invariants in 844 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:56] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:26:57] [INFO ] Implicit Places using invariants and state equation in 1243 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2022-05-19 23:26:57] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:57] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:26:57] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1241/1241 places, 1041/1041 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1163 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=96 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:26:58] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:26:59] [INFO ] [Real]Absence check using 441 positive place invariants in 295 ms returned sat
[2022-05-19 23:26:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:27:02] [INFO ] [Real]Absence check using state equation in 2862 ms returned sat
[2022-05-19 23:27:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:27:03] [INFO ] [Nat]Absence check using 441 positive place invariants in 265 ms returned sat
[2022-05-19 23:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:27:06] [INFO ] [Nat]Absence check using state equation in 2838 ms returned sat
[2022-05-19 23:27:06] [INFO ] Computed and/alt/rep : 1039/1994/1039 causal constraints (skipped 0 transitions) in 58 ms.
[2022-05-19 23:27:17] [INFO ] Added : 550 causal constraints over 110 iterations in 11149 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 94 reset in 813 ms.
Product exploration explored 100000 steps with 97 reset in 962 ms.
Built C files in :
/tmp/ltsmin7743857082499912123
[2022-05-19 23:27:19] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2022-05-19 23:27:19] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:19] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2022-05-19 23:27:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:19] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2022-05-19 23:27:19] [INFO ] Computation of Completed DNA matrix. took 34 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:19] [INFO ] Built C files in 247ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7743857082499912123
Running compilation step : cd /tmp/ltsmin7743857082499912123;'/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/ltsmin7743857082499912123;'/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/ltsmin7743857082499912123;'/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 1 out of 1241 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1241/1241 places, 1041/1041 transitions.
Applied a total of 0 rules in 42 ms. Remains 1241 /1241 variables (removed 0) and now considering 1041/1041 (removed 0) transitions.
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:27:22] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:27:23] [INFO ] Implicit Places using invariants in 552 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:27:23] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:27:24] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 1746 ms to find 0 implicit places.
[2022-05-19 23:27:24] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1041 rows 1241 cols
[2022-05-19 23:27:24] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:27:24] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1241/1241 places, 1041/1041 transitions.
Built C files in :
/tmp/ltsmin1962011752732719261
[2022-05-19 23:27:24] [INFO ] Computing symmetric may disable matrix : 1041 transitions.
[2022-05-19 23:27:24] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:24] [INFO ] Computing symmetric may enable matrix : 1041 transitions.
[2022-05-19 23:27:24] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:25] [INFO ] Computing Do-Not-Accords matrix : 1041 transitions.
[2022-05-19 23:27:25] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:27:25] [INFO ] Built C files in 134ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1962011752732719261
Running compilation step : cd /tmp/ltsmin1962011752732719261;'/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/ltsmin1962011752732719261;'/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/ltsmin1962011752732719261;'/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-19 23:27:28] [INFO ] Flatten gal took : 53 ms
[2022-05-19 23:27:28] [INFO ] Flatten gal took : 42 ms
[2022-05-19 23:27:28] [INFO ] Time to serialize gal into /tmp/LTL1447590347426943914.gal : 12 ms
[2022-05-19 23:27:28] [INFO ] Time to serialize properties into /tmp/LTL5076195455870239569.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/LTL1447590347426943914.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5076195455870239569.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/LTL1447590...266
Read 1 LTL properties
Checking formula 0 : !((G(F("(p1529==1)"))))
Formula 0 simplified : !GF"(p1529==1)"
Detected timeout of ITS tools.
[2022-05-19 23:27:43] [INFO ] Flatten gal took : 38 ms
[2022-05-19 23:27:43] [INFO ] Applying decomposition
[2022-05-19 23:27:43] [INFO ] Flatten gal took : 38 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/graph4996659110459644312.txt' '-o' '/tmp/graph4996659110459644312.bin' '-w' '/tmp/graph4996659110459644312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph4996659110459644312.bin' '-l' '-1' '-v' '-w' '/tmp/graph4996659110459644312.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:27:43] [INFO ] Decomposing Gal with order
[2022-05-19 23:27:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:27:43] [INFO ] Removed a total of 240 redundant transitions.
[2022-05-19 23:27:44] [INFO ] Flatten gal took : 548 ms
[2022-05-19 23:27:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 26 ms.
[2022-05-19 23:27:44] [INFO ] Time to serialize gal into /tmp/LTL4891944864486627985.gal : 15 ms
[2022-05-19 23:27:44] [INFO ] Time to serialize properties into /tmp/LTL10546448958605388543.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/LTL4891944864486627985.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10546448958605388543.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/LTL4891944...246
Read 1 LTL properties
Checking formula 0 : !((G(F("(i22.i2.u244.p1529==1)"))))
Formula 0 simplified : !GF"(i22.i2.u244.p1529==1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14142373548379689433
[2022-05-19 23:27:59] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14142373548379689433
Running compilation step : cd /tmp/ltsmin14142373548379689433;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1887 ms.
Running link step : cd /tmp/ltsmin14142373548379689433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin14142373548379689433;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-03 finished in 103263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2164 transition count 1764
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1964 transition count 1764
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 966 place count 1960 transition count 1760
Iterating global reduction 2 with 4 rules applied. Total rules applied 970 place count 1960 transition count 1760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 970 place count 1960 transition count 1759
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 715 Post agglomeration using F-continuation condition.Transition count delta: 715
Deduced a syphon composed of 715 places in 1 ms
Reduce places removed 715 places and 0 transitions.
Iterating global reduction 2 with 1430 rules applied. Total rules applied 2402 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 1242 transition count 1042
Applied a total of 2404 rules in 377 ms. Remains 1242 /2446 variables (removed 1204) and now considering 1042/2246 (removed 1204) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:28:14] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:28:15] [INFO ] Implicit Places using invariants in 601 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:28:15] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:28:16] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1781 ms to find 0 implicit places.
[2022-05-19 23:28:16] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:28:16] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:28:17] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/2446 places, 1042/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2446 places, 1042/2246 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1005 1) (EQ s1026 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2652 steps with 0 reset in 29 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-04 finished in 2825 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||G(p1))))'
Support contains 3 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2442 transition count 2242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2442 transition count 2242
Applied a total of 8 rules in 184 ms. Remains 2442 /2446 variables (removed 4) and now considering 2242/2246 (removed 4) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:17] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:28:18] [INFO ] Implicit Places using invariants in 828 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:18] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:28:20] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 3206 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:20] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:28:22] [INFO ] Dead Transitions using invariants and state equation in 1333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2446 places, 2242/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2446 places, 2242/2246 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (EQ s312 1) (EQ s314 1)), p1:(EQ s1891 1)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-06 finished in 4931 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(((X(p1) U p2)&&p0)) U (p1 U p3)))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2442 transition count 2242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2442 transition count 2242
Applied a total of 8 rules in 178 ms. Remains 2442 /2446 variables (removed 4) and now considering 2242/2246 (removed 4) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:22] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:28:23] [INFO ] Implicit Places using invariants in 805 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:23] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:28:25] [INFO ] Implicit Places using invariants and state equation in 2349 ms returned []
Implicit Place search using SMT with State Equation took 3165 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:25] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:28:26] [INFO ] Dead Transitions using invariants and state equation in 1348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2446 places, 2242/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2446 places, 2242/2246 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p3), (AND p0 p2), (AND p0 p2 (NOT p3)), true, (AND p1 p2), (NOT p3), (AND (NOT p3) p1 (NOT p0) p2)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s1385 1) (EQ s1387 1)), p1:(EQ s1815 1), p0:(AND (EQ s1815 1) (NEQ s228 1)), p2:(EQ s228 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33361 reset in 1007 ms.
Product exploration explored 100000 steps with 33182 reset in 1031 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2442 stabilizing places and 479/2242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p3) p1 p0 p2))), (X (NOT (AND p0 p2))), (X (NOT p3)), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND (NOT p3) p1 p0 (NOT p2)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1) p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 1487 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 7 states, 16 edges and 4 AP.
Stuttering acceptance computed with spot in 263 ms :[(NOT p3), (AND p0 p2), (AND p0 p2 (NOT p3)), true, (AND p1 p2), (NOT p3), (AND (NOT p3) p1 p2 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 13) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:31] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:28:32] [INFO ] [Real]Absence check using 441 positive place invariants in 142 ms returned sat
[2022-05-19 23:28:33] [INFO ] After 1161ms SMT Verify possible using state equation in real domain returned unsat :5 sat :1 real:1
[2022-05-19 23:28:34] [INFO ] Deduced a trap composed of 16 places in 619 ms of which 4 ms to minimize.
[2022-05-19 23:28:35] [INFO ] Deduced a trap composed of 31 places in 648 ms of which 1 ms to minimize.
[2022-05-19 23:28:35] [INFO ] Deduced a trap composed of 39 places in 613 ms of which 2 ms to minimize.
[2022-05-19 23:28:36] [INFO ] Deduced a trap composed of 21 places in 602 ms of which 1 ms to minimize.
[2022-05-19 23:28:37] [INFO ] Deduced a trap composed of 29 places in 674 ms of which 2 ms to minimize.
[2022-05-19 23:28:37] [INFO ] Deduced a trap composed of 48 places in 599 ms of which 1 ms to minimize.
[2022-05-19 23:28:38] [INFO ] Deduced a trap composed of 23 places in 567 ms of which 1 ms to minimize.
[2022-05-19 23:28:39] [INFO ] Deduced a trap composed of 27 places in 604 ms of which 1 ms to minimize.
[2022-05-19 23:28:39] [INFO ] Deduced a trap composed of 42 places in 553 ms of which 2 ms to minimize.
[2022-05-19 23:28:40] [INFO ] Deduced a trap composed of 26 places in 540 ms of which 1 ms to minimize.
[2022-05-19 23:28:41] [INFO ] Deduced a trap composed of 34 places in 529 ms of which 1 ms to minimize.
[2022-05-19 23:28:41] [INFO ] Deduced a trap composed of 30 places in 523 ms of which 1 ms to minimize.
[2022-05-19 23:28:42] [INFO ] Deduced a trap composed of 30 places in 528 ms of which 2 ms to minimize.
[2022-05-19 23:28:42] [INFO ] Deduced a trap composed of 41 places in 502 ms of which 1 ms to minimize.
[2022-05-19 23:28:43] [INFO ] Deduced a trap composed of 33 places in 471 ms of which 1 ms to minimize.
[2022-05-19 23:28:44] [INFO ] Deduced a trap composed of 28 places in 488 ms of which 1 ms to minimize.
[2022-05-19 23:28:44] [INFO ] Deduced a trap composed of 31 places in 495 ms of which 1 ms to minimize.
[2022-05-19 23:28:45] [INFO ] Deduced a trap composed of 34 places in 496 ms of which 1 ms to minimize.
[2022-05-19 23:28:45] [INFO ] Deduced a trap composed of 35 places in 494 ms of which 1 ms to minimize.
[2022-05-19 23:28:46] [INFO ] Deduced a trap composed of 45 places in 500 ms of which 1 ms to minimize.
[2022-05-19 23:28:47] [INFO ] Deduced a trap composed of 37 places in 522 ms of which 2 ms to minimize.
[2022-05-19 23:28:47] [INFO ] Deduced a trap composed of 41 places in 503 ms of which 2 ms to minimize.
[2022-05-19 23:28:48] [INFO ] Deduced a trap composed of 30 places in 475 ms of which 2 ms to minimize.
[2022-05-19 23:28:48] [INFO ] Deduced a trap composed of 60 places in 466 ms of which 2 ms to minimize.
[2022-05-19 23:28:49] [INFO ] Deduced a trap composed of 49 places in 460 ms of which 1 ms to minimize.
[2022-05-19 23:28:49] [INFO ] Deduced a trap composed of 54 places in 407 ms of which 1 ms to minimize.
[2022-05-19 23:28:50] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2022-05-19 23:28:50] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 1 ms to minimize.
[2022-05-19 23:28:51] [INFO ] Deduced a trap composed of 45 places in 403 ms of which 1 ms to minimize.
[2022-05-19 23:28:51] [INFO ] Deduced a trap composed of 37 places in 391 ms of which 2 ms to minimize.
[2022-05-19 23:28:52] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 0 ms to minimize.
[2022-05-19 23:28:52] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 1 ms to minimize.
[2022-05-19 23:28:53] [INFO ] Deduced a trap composed of 55 places in 346 ms of which 0 ms to minimize.
[2022-05-19 23:28:53] [INFO ] Deduced a trap composed of 43 places in 335 ms of which 0 ms to minimize.
[2022-05-19 23:28:53] [INFO ] Deduced a trap composed of 54 places in 329 ms of which 1 ms to minimize.
[2022-05-19 23:28:54] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 1 ms to minimize.
[2022-05-19 23:28:54] [INFO ] Deduced a trap composed of 53 places in 322 ms of which 1 ms to minimize.
[2022-05-19 23:28:55] [INFO ] Deduced a trap composed of 61 places in 333 ms of which 1 ms to minimize.
[2022-05-19 23:28:55] [INFO ] Deduced a trap composed of 48 places in 306 ms of which 1 ms to minimize.
[2022-05-19 23:28:55] [INFO ] Deduced a trap composed of 48 places in 302 ms of which 1 ms to minimize.
[2022-05-19 23:28:56] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 1 ms to minimize.
[2022-05-19 23:28:56] [INFO ] Deduced a trap composed of 64 places in 298 ms of which 1 ms to minimize.
[2022-05-19 23:28:57] [INFO ] Deduced a trap composed of 48 places in 294 ms of which 2 ms to minimize.
[2022-05-19 23:28:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:28:57] [INFO ] After 25117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 506 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 17 ms.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p1) p0 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p3) p1 p0 p2))), (X (NOT (AND p0 p2))), (X (NOT p3)), (X (AND (NOT p3) (NOT p1))), (X (NOT (AND (NOT p3) p1 p0 (NOT p2)))), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p3) (NOT p1) p0 p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 p0 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p3) p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) p2)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) (NOT p1) p0 p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p3) p2 p1 p0))), (G (NOT (AND p2 p0))), (G (NOT (AND (NOT p3) (NOT p2) (NOT p1) p0))), (G (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0)))), (G (NOT (AND (NOT p3) p2 (NOT p1) p0)))]
False Knowledge obtained : [(F (AND (NOT p3) (NOT p2) p1 p0)), (F (AND p2 p1)), (F (AND (NOT p2) p0)), (F p3), (F (AND (NOT p3) p1)), (F (NOT (AND (NOT p3) (NOT p1)))), (F (AND (NOT p3) p2 p1 (NOT p0))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 32 factoid took 1950 ms. Reduced automaton from 7 states, 16 edges and 4 AP to 7 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 254 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p1 p0 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 243 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p1 p0 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:28:59] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-19 23:29:01] [INFO ] [Real]Absence check using 441 positive place invariants in 686 ms returned sat
[2022-05-19 23:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:29:14] [INFO ] [Real]Absence check using state equation in 12888 ms returned unknown
Could not prove EG (NOT p3)
Support contains 4 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 107 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:29:14] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:29:15] [INFO ] Implicit Places using invariants in 797 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:29:15] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:29:17] [INFO ] Implicit Places using invariants and state equation in 2319 ms returned []
Implicit Place search using SMT with State Equation took 3128 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:29:17] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:29:19] [INFO ] Dead Transitions using invariants and state equation in 1368 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2442 places, 2242/2242 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2442 stabilizing places and 479/2242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT p3)), (X (NOT (OR (AND p1 p0) (AND p0 p3)))), (X (NOT (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 p0) (AND p0 p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 1016 ms. Reduced automaton from 7 states, 11 edges and 4 AP to 7 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 276 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p0 p1 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:29:20] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:29:21] [INFO ] [Real]Absence check using 441 positive place invariants in 140 ms returned sat
[2022-05-19 23:29:22] [INFO ] After 1074ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2022-05-19 23:29:23] [INFO ] Deduced a trap composed of 16 places in 619 ms of which 1 ms to minimize.
[2022-05-19 23:29:23] [INFO ] Deduced a trap composed of 31 places in 609 ms of which 4 ms to minimize.
[2022-05-19 23:29:24] [INFO ] Deduced a trap composed of 39 places in 605 ms of which 1 ms to minimize.
[2022-05-19 23:29:25] [INFO ] Deduced a trap composed of 21 places in 607 ms of which 2 ms to minimize.
[2022-05-19 23:29:25] [INFO ] Deduced a trap composed of 29 places in 608 ms of which 2 ms to minimize.
[2022-05-19 23:29:26] [INFO ] Deduced a trap composed of 48 places in 572 ms of which 1 ms to minimize.
[2022-05-19 23:29:27] [INFO ] Deduced a trap composed of 23 places in 613 ms of which 1 ms to minimize.
[2022-05-19 23:29:27] [INFO ] Deduced a trap composed of 27 places in 560 ms of which 1 ms to minimize.
[2022-05-19 23:29:28] [INFO ] Deduced a trap composed of 42 places in 560 ms of which 1 ms to minimize.
[2022-05-19 23:29:29] [INFO ] Deduced a trap composed of 26 places in 564 ms of which 1 ms to minimize.
[2022-05-19 23:29:29] [INFO ] Deduced a trap composed of 34 places in 559 ms of which 3 ms to minimize.
[2022-05-19 23:29:30] [INFO ] Deduced a trap composed of 30 places in 498 ms of which 1 ms to minimize.
[2022-05-19 23:29:31] [INFO ] Deduced a trap composed of 30 places in 499 ms of which 1 ms to minimize.
[2022-05-19 23:29:31] [INFO ] Deduced a trap composed of 41 places in 494 ms of which 2 ms to minimize.
[2022-05-19 23:29:32] [INFO ] Deduced a trap composed of 33 places in 484 ms of which 1 ms to minimize.
[2022-05-19 23:29:32] [INFO ] Deduced a trap composed of 28 places in 495 ms of which 2 ms to minimize.
[2022-05-19 23:29:33] [INFO ] Deduced a trap composed of 31 places in 502 ms of which 1 ms to minimize.
[2022-05-19 23:29:33] [INFO ] Deduced a trap composed of 34 places in 488 ms of which 1 ms to minimize.
[2022-05-19 23:29:34] [INFO ] Deduced a trap composed of 35 places in 473 ms of which 1 ms to minimize.
[2022-05-19 23:29:35] [INFO ] Deduced a trap composed of 45 places in 484 ms of which 1 ms to minimize.
[2022-05-19 23:29:35] [INFO ] Deduced a trap composed of 37 places in 468 ms of which 1 ms to minimize.
[2022-05-19 23:29:36] [INFO ] Deduced a trap composed of 41 places in 468 ms of which 2 ms to minimize.
[2022-05-19 23:29:36] [INFO ] Deduced a trap composed of 30 places in 478 ms of which 1 ms to minimize.
[2022-05-19 23:29:37] [INFO ] Deduced a trap composed of 60 places in 480 ms of which 2 ms to minimize.
[2022-05-19 23:29:37] [INFO ] Deduced a trap composed of 49 places in 486 ms of which 1 ms to minimize.
[2022-05-19 23:29:38] [INFO ] Deduced a trap composed of 54 places in 436 ms of which 1 ms to minimize.
[2022-05-19 23:29:38] [INFO ] Deduced a trap composed of 32 places in 398 ms of which 1 ms to minimize.
[2022-05-19 23:29:39] [INFO ] Deduced a trap composed of 37 places in 416 ms of which 1 ms to minimize.
[2022-05-19 23:29:39] [INFO ] Deduced a trap composed of 45 places in 417 ms of which 1 ms to minimize.
[2022-05-19 23:29:40] [INFO ] Deduced a trap composed of 37 places in 390 ms of which 1 ms to minimize.
[2022-05-19 23:29:40] [INFO ] Deduced a trap composed of 39 places in 340 ms of which 1 ms to minimize.
[2022-05-19 23:29:41] [INFO ] Deduced a trap composed of 53 places in 330 ms of which 1 ms to minimize.
[2022-05-19 23:29:41] [INFO ] Deduced a trap composed of 55 places in 331 ms of which 1 ms to minimize.
[2022-05-19 23:29:42] [INFO ] Deduced a trap composed of 43 places in 334 ms of which 1 ms to minimize.
[2022-05-19 23:29:42] [INFO ] Deduced a trap composed of 54 places in 321 ms of which 1 ms to minimize.
[2022-05-19 23:29:42] [INFO ] Deduced a trap composed of 41 places in 326 ms of which 0 ms to minimize.
[2022-05-19 23:29:43] [INFO ] Deduced a trap composed of 53 places in 323 ms of which 1 ms to minimize.
[2022-05-19 23:29:43] [INFO ] Deduced a trap composed of 61 places in 347 ms of which 1 ms to minimize.
[2022-05-19 23:29:44] [INFO ] Deduced a trap composed of 48 places in 310 ms of which 0 ms to minimize.
[2022-05-19 23:29:44] [INFO ] Deduced a trap composed of 48 places in 320 ms of which 1 ms to minimize.
[2022-05-19 23:29:45] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 0 ms to minimize.
[2022-05-19 23:29:45] [INFO ] Deduced a trap composed of 64 places in 293 ms of which 0 ms to minimize.
[2022-05-19 23:29:45] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 1 ms to minimize.
[2022-05-19 23:29:46] [INFO ] Deduced a trap composed of 59 places in 288 ms of which 0 ms to minimize.
[2022-05-19 23:29:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:29:46] [INFO ] After 25283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished Parikh walk after 524 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=34 )
Parikh walk visited 2 properties in 16 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p0) (NOT p3))), (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3))))), (X (NOT p3)), (X (NOT (OR (AND p1 p0) (AND p0 p3)))), (X (NOT (AND p1 p0 (NOT p3)))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2) (NOT p3)))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p0 (NOT p3)))))), (X (X (NOT p3))), (X (X (NOT (OR (AND p1 p0) (AND p0 p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p1 p0 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p3) p0 p1)), (F (OR (AND p3 p0) (AND p0 p1))), (F (OR (AND (NOT p3) (NOT p2) p0) (AND (NOT p2) p1))), (F (AND p2 p1)), (F p3), (F (OR (AND (NOT p3) p0) (AND (NOT p3) p1))), (F (NOT (AND (NOT p3) (NOT p0) (NOT p1)))), (F (AND (NOT p3) p2 p1))]
Knowledge based reduction with 17 factoid took 1058 ms. Reduced automaton from 7 states, 11 edges and 4 AP to 7 states, 11 edges and 4 AP.
Stuttering acceptance computed with spot in 274 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p0 p1 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
Stuttering acceptance computed with spot in 248 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p0 p1 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:29:47] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:29:50] [INFO ] [Real]Absence check using 441 positive place invariants in 710 ms returned sat
[2022-05-19 23:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:30:02] [INFO ] [Real]Absence check using state equation in 12776 ms returned unknown
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 359 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p0 p1 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
Product exploration explored 100000 steps with 33289 reset in 1018 ms.
Product exploration explored 100000 steps with 33257 reset in 1015 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 298 ms :[(NOT p3), (AND p0 p1 p2), (AND (NOT p3) p0 p1 p2), true, (AND p1 p2), (NOT p3), (AND p1 p2 (NOT p3))]
Support contains 4 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2442 transition count 2242
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 281 place count 2442 transition count 2243
Deduced a syphon composed of 362 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 362 place count 2442 transition count 2243
Performed 835 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1197 places in 2 ms
Iterating global reduction 1 with 835 rules applied. Total rules applied 1197 place count 2442 transition count 2243
Renaming transitions due to excessive name length > 1024 char.
Discarding 281 places :
Symmetric choice reduction at 1 with 281 rule applications. Total rules 1478 place count 2161 transition count 1962
Deduced a syphon composed of 916 places in 2 ms
Iterating global reduction 1 with 281 rules applied. Total rules applied 1759 place count 2161 transition count 1962
Deduced a syphon composed of 916 places in 1 ms
Applied a total of 1759 rules in 863 ms. Remains 2161 /2442 variables (removed 281) and now considering 1962/2242 (removed 280) transitions.
[2022-05-19 23:30:06] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1962 rows 2161 cols
[2022-05-19 23:30:06] [INFO ] Computed 441 place invariants in 17 ms
[2022-05-19 23:30:07] [INFO ] Dead Transitions using invariants and state equation in 1201 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2161/2442 places, 1962/2242 transitions.
Finished structural reductions, in 1 iterations. Remains : 2161/2442 places, 1962/2242 transitions.
Product exploration explored 100000 steps with 33244 reset in 1025 ms.
Product exploration explored 100000 steps with 33345 reset in 1026 ms.
Built C files in :
/tmp/ltsmin2335858241363483446
[2022-05-19 23:30:09] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2335858241363483446
Running compilation step : cd /tmp/ltsmin2335858241363483446;'/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/ltsmin2335858241363483446;'/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/ltsmin2335858241363483446;'/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 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 125 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:30:13] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:30:14] [INFO ] Implicit Places using invariants in 1473 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:30:14] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:30:16] [INFO ] Implicit Places using invariants and state equation in 2407 ms returned []
Implicit Place search using SMT with State Equation took 3890 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:30:16] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:30:18] [INFO ] Dead Transitions using invariants and state equation in 1362 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2442 places, 2242/2242 transitions.
Built C files in :
/tmp/ltsmin7413038081486050167
[2022-05-19 23:30:18] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7413038081486050167
Running compilation step : cd /tmp/ltsmin7413038081486050167;'/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/ltsmin7413038081486050167;'/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/ltsmin7413038081486050167;'/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-19 23:30:21] [INFO ] Flatten gal took : 69 ms
[2022-05-19 23:30:21] [INFO ] Flatten gal took : 61 ms
[2022-05-19 23:30:21] [INFO ] Time to serialize gal into /tmp/LTL7199937132579419972.gal : 8 ms
[2022-05-19 23:30:21] [INFO ] Time to serialize properties into /tmp/LTL11176266705800251885.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/LTL7199937132579419972.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11176266705800251885.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/LTL7199937...267
Read 1 LTL properties
Checking formula 0 : !(((!(X((((X("(p2018==1)"))U("(p249==1)"))&&("(p2018==1)"))&&("(p249!=1)"))))U(("(p2018==1)")U("((p1539==1)&&(p1541==1))"))))
Formula 0 simplified : !(!X("(p249!=1)" & "(p2018==1)" & (X"(p2018==1)" U "(p249==1)")) U ("(p2018==1)" U "((p1539==1)&&(p1541==1))"))
Detected timeout of ITS tools.
[2022-05-19 23:30:36] [INFO ] Flatten gal took : 58 ms
[2022-05-19 23:30:36] [INFO ] Applying decomposition
[2022-05-19 23:30:36] [INFO ] Flatten gal took : 59 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/graph16330414027626593385.txt' '-o' '/tmp/graph16330414027626593385.bin' '-w' '/tmp/graph16330414027626593385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16330414027626593385.bin' '-l' '-1' '-v' '-w' '/tmp/graph16330414027626593385.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:30:36] [INFO ] Decomposing Gal with order
[2022-05-19 23:30:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:30:37] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:30:37] [INFO ] Flatten gal took : 135 ms
[2022-05-19 23:30:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-19 23:30:37] [INFO ] Time to serialize gal into /tmp/LTL17483875959999724775.gal : 19 ms
[2022-05-19 23:30:37] [INFO ] Time to serialize properties into /tmp/LTL3631072886484082714.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/LTL17483875959999724775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3631072886484082714.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/LTL1748387...246
Read 1 LTL properties
Checking formula 0 : !(((!(X((((X("(i29.i0.i1.u716.p2018==1)"))U("(i3.i0.i0.u91.p249==1)"))&&("(i29.i0.i1.u716.p2018==1)"))&&("(i3.i0.i0.u91.p249!=1)"))))U...247
Formula 0 simplified : !(!X("(i3.i0.i0.u91.p249!=1)" & "(i29.i0.i1.u716.p2018==1)" & (X"(i29.i0.i1.u716.p2018==1)" U "(i3.i0.i0.u91.p249==1)")) U ("(i29.i0...235
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15052863897516180657
[2022-05-19 23:30:52] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15052863897516180657
Running compilation step : cd /tmp/ltsmin15052863897516180657;'/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/ltsmin15052863897516180657;'/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/ltsmin15052863897516180657;'/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 ShieldPPPs-PT-040B-LTLFireability-07 finished in 153201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Support contains 2 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2442 transition count 2242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2442 transition count 2242
Applied a total of 8 rules in 215 ms. Remains 2442 /2446 variables (removed 4) and now considering 2242/2246 (removed 4) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:30:55] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:30:56] [INFO ] Implicit Places using invariants in 850 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:30:56] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:30:59] [INFO ] Implicit Places using invariants and state equation in 2637 ms returned []
Implicit Place search using SMT with State Equation took 3497 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:30:59] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:31:00] [INFO ] Dead Transitions using invariants and state equation in 1347 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2446 places, 2242/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2446 places, 2242/2246 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s177 1) (EQ s201 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 18 reset in 937 ms.
Product exploration explored 100000 steps with 18 reset in 1087 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174502 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174502 steps, saw 159380 distinct states, run finished after 3005 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:31:05] [INFO ] Computed 441 place invariants in 13 ms
[2022-05-19 23:31:06] [INFO ] [Real]Absence check using 441 positive place invariants in 152 ms returned sat
[2022-05-19 23:31:07] [INFO ] After 1635ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:31:07] [INFO ] [Nat]Absence check using 441 positive place invariants in 153 ms returned sat
[2022-05-19 23:31:09] [INFO ] After 1164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:31:09] [INFO ] Deduced a trap composed of 17 places in 630 ms of which 2 ms to minimize.
[2022-05-19 23:31:10] [INFO ] Deduced a trap composed of 19 places in 601 ms of which 1 ms to minimize.
[2022-05-19 23:31:11] [INFO ] Deduced a trap composed of 63 places in 586 ms of which 2 ms to minimize.
[2022-05-19 23:31:11] [INFO ] Deduced a trap composed of 18 places in 583 ms of which 2 ms to minimize.
[2022-05-19 23:31:12] [INFO ] Deduced a trap composed of 20 places in 588 ms of which 1 ms to minimize.
[2022-05-19 23:31:13] [INFO ] Deduced a trap composed of 20 places in 548 ms of which 1 ms to minimize.
[2022-05-19 23:31:13] [INFO ] Deduced a trap composed of 20 places in 560 ms of which 1 ms to minimize.
[2022-05-19 23:31:14] [INFO ] Deduced a trap composed of 26 places in 547 ms of which 1 ms to minimize.
[2022-05-19 23:31:15] [INFO ] Deduced a trap composed of 28 places in 543 ms of which 1 ms to minimize.
[2022-05-19 23:31:15] [INFO ] Deduced a trap composed of 32 places in 566 ms of which 1 ms to minimize.
[2022-05-19 23:31:16] [INFO ] Deduced a trap composed of 36 places in 526 ms of which 1 ms to minimize.
[2022-05-19 23:31:17] [INFO ] Deduced a trap composed of 41 places in 571 ms of which 1 ms to minimize.
[2022-05-19 23:31:17] [INFO ] Deduced a trap composed of 38 places in 538 ms of which 2 ms to minimize.
[2022-05-19 23:31:18] [INFO ] Deduced a trap composed of 38 places in 520 ms of which 1 ms to minimize.
[2022-05-19 23:31:18] [INFO ] Deduced a trap composed of 37 places in 540 ms of which 1 ms to minimize.
[2022-05-19 23:31:19] [INFO ] Deduced a trap composed of 25 places in 511 ms of which 1 ms to minimize.
[2022-05-19 23:31:20] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 2 ms to minimize.
[2022-05-19 23:31:20] [INFO ] Deduced a trap composed of 32 places in 528 ms of which 1 ms to minimize.
[2022-05-19 23:31:21] [INFO ] Deduced a trap composed of 35 places in 516 ms of which 1 ms to minimize.
[2022-05-19 23:31:21] [INFO ] Deduced a trap composed of 40 places in 505 ms of which 1 ms to minimize.
[2022-05-19 23:31:22] [INFO ] Deduced a trap composed of 24 places in 479 ms of which 1 ms to minimize.
[2022-05-19 23:31:22] [INFO ] Deduced a trap composed of 26 places in 454 ms of which 1 ms to minimize.
[2022-05-19 23:31:23] [INFO ] Deduced a trap composed of 32 places in 526 ms of which 1 ms to minimize.
[2022-05-19 23:31:24] [INFO ] Deduced a trap composed of 39 places in 524 ms of which 1 ms to minimize.
[2022-05-19 23:31:24] [INFO ] Deduced a trap composed of 38 places in 540 ms of which 1 ms to minimize.
[2022-05-19 23:31:25] [INFO ] Deduced a trap composed of 30 places in 550 ms of which 1 ms to minimize.
[2022-05-19 23:31:26] [INFO ] Deduced a trap composed of 60 places in 543 ms of which 2 ms to minimize.
[2022-05-19 23:31:26] [INFO ] Deduced a trap composed of 32 places in 542 ms of which 2 ms to minimize.
[2022-05-19 23:31:27] [INFO ] Deduced a trap composed of 21 places in 514 ms of which 1 ms to minimize.
[2022-05-19 23:31:27] [INFO ] Deduced a trap composed of 36 places in 513 ms of which 2 ms to minimize.
[2022-05-19 23:31:28] [INFO ] Deduced a trap composed of 25 places in 503 ms of which 1 ms to minimize.
[2022-05-19 23:31:29] [INFO ] Deduced a trap composed of 40 places in 495 ms of which 1 ms to minimize.
[2022-05-19 23:31:29] [INFO ] Deduced a trap composed of 51 places in 475 ms of which 2 ms to minimize.
[2022-05-19 23:31:30] [INFO ] Deduced a trap composed of 26 places in 481 ms of which 2 ms to minimize.
[2022-05-19 23:31:30] [INFO ] Deduced a trap composed of 34 places in 453 ms of which 1 ms to minimize.
[2022-05-19 23:31:31] [INFO ] Deduced a trap composed of 43 places in 440 ms of which 1 ms to minimize.
[2022-05-19 23:31:31] [INFO ] Deduced a trap composed of 44 places in 444 ms of which 1 ms to minimize.
[2022-05-19 23:31:32] [INFO ] Deduced a trap composed of 42 places in 437 ms of which 1 ms to minimize.
[2022-05-19 23:31:32] [INFO ] Deduced a trap composed of 47 places in 442 ms of which 1 ms to minimize.
[2022-05-19 23:31:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:31:32] [INFO ] After 25194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2442 transition count 1961
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2161 transition count 1961
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2161 transition count 1761
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1961 transition count 1761
Performed 718 Post agglomeration using F-continuation condition.Transition count delta: 718
Deduced a syphon composed of 718 places in 2 ms
Reduce places removed 718 places and 0 transitions.
Iterating global reduction 2 with 1436 rules applied. Total rules applied 2398 place count 1243 transition count 1043
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 357 times.
Drop transitions removed 357 transitions
Iterating global reduction 2 with 357 rules applied. Total rules applied 2755 place count 1243 transition count 1043
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2756 place count 1242 transition count 1042
Applied a total of 2756 rules in 298 ms. Remains 1242 /2442 variables (removed 1200) and now considering 1042/2242 (removed 1200) transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2442 places, 1042/2242 transitions.
Finished random walk after 2643 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=97 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:31:33] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-19 23:31:35] [INFO ] [Real]Absence check using 441 positive place invariants in 748 ms returned sat
[2022-05-19 23:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:31:48] [INFO ] [Real]Absence check using state equation in 12865 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2441 transition count 1960
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2160 transition count 1960
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2160 transition count 1760
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1960 transition count 1760
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2394 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2396 place count 1242 transition count 1042
Applied a total of 2396 rules in 271 ms. Remains 1242 /2442 variables (removed 1200) and now considering 1042/2242 (removed 1200) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:31:48] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:31:49] [INFO ] Implicit Places using invariants in 567 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:31:49] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:31:50] [INFO ] Implicit Places using invariants and state equation in 1231 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2022-05-19 23:31:50] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:31:50] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:31:50] [INFO ] Dead Transitions using invariants and state equation in 551 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1242/2442 places, 1042/2242 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2442 places, 1042/2242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 2245 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=106 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:31:51] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:31:52] [INFO ] [Real]Absence check using 441 positive place invariants in 280 ms returned sat
[2022-05-19 23:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:31:55] [INFO ] [Real]Absence check using state equation in 2769 ms returned sat
[2022-05-19 23:31:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:31:56] [INFO ] [Nat]Absence check using 441 positive place invariants in 286 ms returned sat
[2022-05-19 23:31:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:31:59] [INFO ] [Nat]Absence check using state equation in 3391 ms returned sat
[2022-05-19 23:31:59] [INFO ] Computed and/alt/rep : 1039/1996/1039 causal constraints (skipped 0 transitions) in 49 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-19 23:32:10] [INFO ] Deduced a trap composed of 2 places in 536 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:686)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:322)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:78)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:686)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 23:32:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 42 reset in 852 ms.
Product exploration explored 100000 steps with 42 reset in 993 ms.
Built C files in :
/tmp/ltsmin13224155965597391307
[2022-05-19 23:32:12] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2022-05-19 23:32:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:12] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2022-05-19 23:32:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:12] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2022-05-19 23:32:12] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:12] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13224155965597391307
Running compilation step : cd /tmp/ltsmin13224155965597391307;'/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/ltsmin13224155965597391307;'/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/ltsmin13224155965597391307;'/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 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 31 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:32:15] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:32:16] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:32:16] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:32:17] [INFO ] Implicit Places using invariants and state equation in 1233 ms returned []
Implicit Place search using SMT with State Equation took 1797 ms to find 0 implicit places.
[2022-05-19 23:32:17] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:32:17] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:32:18] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/1242 places, 1042/1042 transitions.
Built C files in :
/tmp/ltsmin8197599378578260198
[2022-05-19 23:32:18] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2022-05-19 23:32:18] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:18] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2022-05-19 23:32:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:18] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2022-05-19 23:32:18] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:32:18] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8197599378578260198
Running compilation step : cd /tmp/ltsmin8197599378578260198;'/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/ltsmin8197599378578260198;'/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/ltsmin8197599378578260198;'/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-19 23:32:21] [INFO ] Flatten gal took : 63 ms
[2022-05-19 23:32:21] [INFO ] Flatten gal took : 33 ms
[2022-05-19 23:32:21] [INFO ] Time to serialize gal into /tmp/LTL13979650080561815878.gal : 4 ms
[2022-05-19 23:32:21] [INFO ] Time to serialize properties into /tmp/LTL9065120537622419878.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/LTL13979650080561815878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9065120537622419878.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/LTL1397965...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F("((p191==1)&&(p216==1))")))))
Formula 0 simplified : !FXF"((p191==1)&&(p216==1))"
Detected timeout of ITS tools.
[2022-05-19 23:32:36] [INFO ] Flatten gal took : 33 ms
[2022-05-19 23:32:36] [INFO ] Applying decomposition
[2022-05-19 23:32:36] [INFO ] Flatten gal took : 33 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/graph7772863161796172222.txt' '-o' '/tmp/graph7772863161796172222.bin' '-w' '/tmp/graph7772863161796172222.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7772863161796172222.bin' '-l' '-1' '-v' '-w' '/tmp/graph7772863161796172222.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:32:36] [INFO ] Decomposing Gal with order
[2022-05-19 23:32:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:32:36] [INFO ] Removed a total of 242 redundant transitions.
[2022-05-19 23:32:36] [INFO ] Flatten gal took : 55 ms
[2022-05-19 23:32:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 478 labels/synchronizations in 13 ms.
[2022-05-19 23:32:36] [INFO ] Time to serialize gal into /tmp/LTL3597412423282779069.gal : 9 ms
[2022-05-19 23:32:36] [INFO ] Time to serialize properties into /tmp/LTL8783255023814366504.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/LTL3597412423282779069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8783255023814366504.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/LTL3597412...245
Read 1 LTL properties
Checking formula 0 : !((F(X(F("((i2.i1.u24.p191==1)&&(i2.i2.u31.p216==1))")))))
Formula 0 simplified : !FXF"((i2.i1.u24.p191==1)&&(i2.i2.u31.p216==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin942111335468342568
[2022-05-19 23:32:51] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin942111335468342568
Running compilation step : cd /tmp/ltsmin942111335468342568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1894 ms.
Running link step : cd /tmp/ltsmin942111335468342568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin942111335468342568;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-08 finished in 131629 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||F((X(X((X(p1)&&X(p2))))&&p3)))))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2443 transition count 2243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2443 transition count 2243
Applied a total of 6 rules in 229 ms. Remains 2443 /2446 variables (removed 3) and now considering 2243/2246 (removed 3) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:33:07] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:33:08] [INFO ] Implicit Places using invariants in 874 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:33:08] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:33:10] [INFO ] Implicit Places using invariants and state equation in 2444 ms returned []
Implicit Place search using SMT with State Equation took 3321 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:33:10] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:33:12] [INFO ] Dead Transitions using invariants and state equation in 1370 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2443/2446 places, 2243/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2446 places, 2243/2246 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 5}, { cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 6}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=3 dest: 7}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 8}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=4 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p3 (NOT p0)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=6 dest: 4}], [{ cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p2))), acceptance={0} source=7 dest: 7}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=7 dest: 8}], [{ cond=(OR (AND p3 (NOT p0) (NOT p1)) (AND p3 (NOT p0) (NOT p2))), acceptance={0} source=8 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=8 dest: 2}]], initial=0, aps=[p3:(EQ s560 0), p0:(EQ s1724 1), p1:(EQ s764 1), p2:(EQ s2411 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 726 reset in 319 ms.
Product exploration explored 100000 steps with 713 reset in 335 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2443 stabilizing places and 479/2243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p3 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 278 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 417 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:33:14] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:33:14] [INFO ] After 303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 23:33:14] [INFO ] [Nat]Absence check using 441 positive place invariants in 147 ms returned sat
[2022-05-19 23:33:16] [INFO ] After 1207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 23:33:16] [INFO ] Deduced a trap composed of 20 places in 671 ms of which 2 ms to minimize.
[2022-05-19 23:33:17] [INFO ] Deduced a trap composed of 23 places in 651 ms of which 1 ms to minimize.
[2022-05-19 23:33:18] [INFO ] Deduced a trap composed of 22 places in 637 ms of which 1 ms to minimize.
[2022-05-19 23:33:19] [INFO ] Deduced a trap composed of 33 places in 595 ms of which 2 ms to minimize.
[2022-05-19 23:33:19] [INFO ] Deduced a trap composed of 18 places in 623 ms of which 1 ms to minimize.
[2022-05-19 23:33:20] [INFO ] Deduced a trap composed of 21 places in 571 ms of which 1 ms to minimize.
[2022-05-19 23:33:21] [INFO ] Deduced a trap composed of 38 places in 596 ms of which 1 ms to minimize.
[2022-05-19 23:33:21] [INFO ] Deduced a trap composed of 29 places in 572 ms of which 1 ms to minimize.
[2022-05-19 23:33:22] [INFO ] Deduced a trap composed of 44 places in 579 ms of which 2 ms to minimize.
[2022-05-19 23:33:22] [INFO ] Deduced a trap composed of 19 places in 561 ms of which 2 ms to minimize.
[2022-05-19 23:33:23] [INFO ] Deduced a trap composed of 28 places in 595 ms of which 1 ms to minimize.
[2022-05-19 23:33:24] [INFO ] Deduced a trap composed of 27 places in 590 ms of which 1 ms to minimize.
[2022-05-19 23:33:25] [INFO ] Deduced a trap composed of 21 places in 619 ms of which 2 ms to minimize.
[2022-05-19 23:33:25] [INFO ] Deduced a trap composed of 36 places in 584 ms of which 2 ms to minimize.
[2022-05-19 23:33:26] [INFO ] Deduced a trap composed of 23 places in 656 ms of which 2 ms to minimize.
[2022-05-19 23:33:27] [INFO ] Deduced a trap composed of 25 places in 637 ms of which 2 ms to minimize.
[2022-05-19 23:33:27] [INFO ] Deduced a trap composed of 35 places in 626 ms of which 2 ms to minimize.
[2022-05-19 23:33:28] [INFO ] Deduced a trap composed of 29 places in 646 ms of which 4 ms to minimize.
[2022-05-19 23:33:29] [INFO ] Deduced a trap composed of 22 places in 631 ms of which 2 ms to minimize.
[2022-05-19 23:33:30] [INFO ] Deduced a trap composed of 26 places in 612 ms of which 1 ms to minimize.
[2022-05-19 23:33:30] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 1 ms to minimize.
[2022-05-19 23:33:31] [INFO ] Deduced a trap composed of 32 places in 545 ms of which 1 ms to minimize.
[2022-05-19 23:33:31] [INFO ] Deduced a trap composed of 32 places in 543 ms of which 1 ms to minimize.
[2022-05-19 23:33:32] [INFO ] Deduced a trap composed of 31 places in 535 ms of which 2 ms to minimize.
[2022-05-19 23:33:33] [INFO ] Deduced a trap composed of 28 places in 502 ms of which 1 ms to minimize.
[2022-05-19 23:33:33] [INFO ] Deduced a trap composed of 20 places in 490 ms of which 1 ms to minimize.
[2022-05-19 23:33:34] [INFO ] Deduced a trap composed of 30 places in 506 ms of which 1 ms to minimize.
[2022-05-19 23:33:35] [INFO ] Deduced a trap composed of 40 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:33:35] [INFO ] Deduced a trap composed of 26 places in 504 ms of which 2 ms to minimize.
[2022-05-19 23:33:36] [INFO ] Deduced a trap composed of 24 places in 476 ms of which 1 ms to minimize.
[2022-05-19 23:33:36] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2022-05-19 23:33:37] [INFO ] Deduced a trap composed of 32 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:33:37] [INFO ] Deduced a trap composed of 34 places in 484 ms of which 1 ms to minimize.
[2022-05-19 23:33:38] [INFO ] Deduced a trap composed of 43 places in 482 ms of which 1 ms to minimize.
[2022-05-19 23:33:39] [INFO ] Deduced a trap composed of 49 places in 496 ms of which 1 ms to minimize.
[2022-05-19 23:33:39] [INFO ] Deduced a trap composed of 51 places in 503 ms of which 2 ms to minimize.
[2022-05-19 23:33:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:33:39] [INFO ] After 25239ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 77 ms.
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2443 transition count 1964
Reduce places removed 279 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 281 rules applied. Total rules applied 560 place count 2164 transition count 1962
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 562 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 562 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 962 place count 1962 transition count 1762
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 3 with 1428 rules applied. Total rules applied 2390 place count 1248 transition count 1048
Partial Free-agglomeration rule applied 358 times.
Drop transitions removed 358 transitions
Iterating global reduction 3 with 358 rules applied. Total rules applied 2748 place count 1248 transition count 1048
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2749 place count 1247 transition count 1047
Applied a total of 2749 rules in 311 ms. Remains 1247 /2443 variables (removed 1196) and now considering 1047/2243 (removed 1196) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/2443 places, 1047/2243 transitions.
Finished random walk after 2421 steps, including 0 resets, run visited all 2 properties in 46 ms. (steps per millisecond=52 )
Knowledge obtained : [(AND p3 (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND p3 (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND p3 (NOT p0)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p3))), (F (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2))))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 7 factoid took 322 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 361 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 445 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:33:41] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:33:43] [INFO ] [Real]Absence check using 441 positive place invariants in 444 ms returned sat
[2022-05-19 23:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:33:56] [INFO ] [Real]Absence check using state equation in 13208 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:33:56] [INFO ] Computed 441 place invariants in 19 ms
[2022-05-19 23:33:58] [INFO ] [Real]Absence check using 441 positive place invariants in 421 ms returned sat
[2022-05-19 23:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:34:11] [INFO ] [Real]Absence check using state equation in 13208 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Applied a total of 0 rules in 116 ms. Remains 2443 /2443 variables (removed 0) and now considering 2243/2243 (removed 0) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:34:11] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:34:12] [INFO ] Implicit Places using invariants in 863 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:34:12] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:34:14] [INFO ] Implicit Places using invariants and state equation in 2569 ms returned []
Implicit Place search using SMT with State Equation took 3435 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:34:14] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:34:16] [INFO ] Dead Transitions using invariants and state equation in 1401 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2243/2243 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2443 stabilizing places and 479/2243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 267 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 498 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:34:17] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:34:17] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 23:34:18] [INFO ] [Nat]Absence check using 441 positive place invariants in 145 ms returned sat
[2022-05-19 23:34:19] [INFO ] After 1208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 23:34:20] [INFO ] Deduced a trap composed of 20 places in 632 ms of which 1 ms to minimize.
[2022-05-19 23:34:20] [INFO ] Deduced a trap composed of 23 places in 628 ms of which 2 ms to minimize.
[2022-05-19 23:34:21] [INFO ] Deduced a trap composed of 22 places in 633 ms of which 1 ms to minimize.
[2022-05-19 23:34:22] [INFO ] Deduced a trap composed of 33 places in 608 ms of which 1 ms to minimize.
[2022-05-19 23:34:22] [INFO ] Deduced a trap composed of 18 places in 592 ms of which 2 ms to minimize.
[2022-05-19 23:34:23] [INFO ] Deduced a trap composed of 21 places in 578 ms of which 2 ms to minimize.
[2022-05-19 23:34:24] [INFO ] Deduced a trap composed of 38 places in 561 ms of which 1 ms to minimize.
[2022-05-19 23:34:24] [INFO ] Deduced a trap composed of 29 places in 563 ms of which 2 ms to minimize.
[2022-05-19 23:34:25] [INFO ] Deduced a trap composed of 44 places in 569 ms of which 1 ms to minimize.
[2022-05-19 23:34:26] [INFO ] Deduced a trap composed of 19 places in 585 ms of which 2 ms to minimize.
[2022-05-19 23:34:26] [INFO ] Deduced a trap composed of 28 places in 593 ms of which 1 ms to minimize.
[2022-05-19 23:34:27] [INFO ] Deduced a trap composed of 27 places in 596 ms of which 2 ms to minimize.
[2022-05-19 23:34:28] [INFO ] Deduced a trap composed of 21 places in 607 ms of which 1 ms to minimize.
[2022-05-19 23:34:28] [INFO ] Deduced a trap composed of 36 places in 597 ms of which 2 ms to minimize.
[2022-05-19 23:34:29] [INFO ] Deduced a trap composed of 23 places in 652 ms of which 2 ms to minimize.
[2022-05-19 23:34:30] [INFO ] Deduced a trap composed of 25 places in 638 ms of which 1 ms to minimize.
[2022-05-19 23:34:30] [INFO ] Deduced a trap composed of 35 places in 621 ms of which 2 ms to minimize.
[2022-05-19 23:34:31] [INFO ] Deduced a trap composed of 29 places in 629 ms of which 1 ms to minimize.
[2022-05-19 23:34:32] [INFO ] Deduced a trap composed of 22 places in 612 ms of which 1 ms to minimize.
[2022-05-19 23:34:33] [INFO ] Deduced a trap composed of 26 places in 592 ms of which 2 ms to minimize.
[2022-05-19 23:34:33] [INFO ] Deduced a trap composed of 31 places in 537 ms of which 1 ms to minimize.
[2022-05-19 23:34:34] [INFO ] Deduced a trap composed of 32 places in 547 ms of which 1 ms to minimize.
[2022-05-19 23:34:34] [INFO ] Deduced a trap composed of 32 places in 544 ms of which 1 ms to minimize.
[2022-05-19 23:34:35] [INFO ] Deduced a trap composed of 31 places in 535 ms of which 1 ms to minimize.
[2022-05-19 23:34:36] [INFO ] Deduced a trap composed of 28 places in 500 ms of which 1 ms to minimize.
[2022-05-19 23:34:36] [INFO ] Deduced a trap composed of 20 places in 488 ms of which 1 ms to minimize.
[2022-05-19 23:34:37] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 1 ms to minimize.
[2022-05-19 23:34:38] [INFO ] Deduced a trap composed of 40 places in 503 ms of which 2 ms to minimize.
[2022-05-19 23:34:38] [INFO ] Deduced a trap composed of 26 places in 483 ms of which 1 ms to minimize.
[2022-05-19 23:34:39] [INFO ] Deduced a trap composed of 24 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:34:39] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:34:40] [INFO ] Deduced a trap composed of 32 places in 483 ms of which 1 ms to minimize.
[2022-05-19 23:34:40] [INFO ] Deduced a trap composed of 34 places in 480 ms of which 1 ms to minimize.
[2022-05-19 23:34:41] [INFO ] Deduced a trap composed of 43 places in 479 ms of which 2 ms to minimize.
[2022-05-19 23:34:42] [INFO ] Deduced a trap composed of 49 places in 516 ms of which 2 ms to minimize.
[2022-05-19 23:34:42] [INFO ] Deduced a trap composed of 51 places in 501 ms of which 2 ms to minimize.
[2022-05-19 23:34:42] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:34:42] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 94 ms.
Support contains 4 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Drop transitions removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 2443 transition count 1964
Reduce places removed 279 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 281 rules applied. Total rules applied 560 place count 2164 transition count 1962
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 562 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 562 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 962 place count 1962 transition count 1762
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 1 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 3 with 1428 rules applied. Total rules applied 2390 place count 1248 transition count 1048
Partial Free-agglomeration rule applied 358 times.
Drop transitions removed 358 transitions
Iterating global reduction 3 with 358 rules applied. Total rules applied 2748 place count 1248 transition count 1048
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 2749 place count 1247 transition count 1047
Applied a total of 2749 rules in 322 ms. Remains 1247 /2443 variables (removed 1196) and now considering 1047/2243 (removed 1196) transitions.
Finished structural reductions, in 1 iterations. Remains : 1247/2443 places, 1047/2243 transitions.
Finished random walk after 2778 steps, including 0 resets, run visited all 2 properties in 48 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (AND (NOT p0) p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (AND (NOT p0) p3))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) p3))), (F (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) p3 (NOT p2))))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 7 factoid took 454 ms. Reduced automaton from 9 states, 17 edges and 4 AP to 9 states, 17 edges and 4 AP.
Stuttering acceptance computed with spot in 420 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 395 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:34:44] [INFO ] Computed 441 place invariants in 14 ms
[2022-05-19 23:34:46] [INFO ] [Real]Absence check using 441 positive place invariants in 434 ms returned sat
[2022-05-19 23:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:34:59] [INFO ] [Real]Absence check using state equation in 13236 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:34:59] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:35:01] [INFO ] [Real]Absence check using 441 positive place invariants in 400 ms returned sat
[2022-05-19 23:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:35:14] [INFO ] [Real]Absence check using state equation in 13273 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 391 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 710 reset in 331 ms.
Product exploration explored 100000 steps with 716 reset in 351 ms.
Built C files in :
/tmp/ltsmin7764289350803402310
[2022-05-19 23:35:15] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7764289350803402310
Running compilation step : cd /tmp/ltsmin7764289350803402310;'/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/ltsmin7764289350803402310;'/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/ltsmin7764289350803402310;'/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 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Applied a total of 0 rules in 115 ms. Remains 2443 /2443 variables (removed 0) and now considering 2243/2243 (removed 0) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:35:18] [INFO ] Computed 441 place invariants in 15 ms
[2022-05-19 23:35:19] [INFO ] Implicit Places using invariants in 813 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:35:19] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:35:22] [INFO ] Implicit Places using invariants and state equation in 2409 ms returned []
Implicit Place search using SMT with State Equation took 3224 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:35:22] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:35:23] [INFO ] Dead Transitions using invariants and state equation in 1339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2243/2243 transitions.
Built C files in :
/tmp/ltsmin5027612269469588605
[2022-05-19 23:35:23] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5027612269469588605
Running compilation step : cd /tmp/ltsmin5027612269469588605;'/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/ltsmin5027612269469588605;'/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/ltsmin5027612269469588605;'/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-19 23:35:26] [INFO ] Flatten gal took : 58 ms
[2022-05-19 23:35:26] [INFO ] Flatten gal took : 69 ms
[2022-05-19 23:35:26] [INFO ] Time to serialize gal into /tmp/LTL16598373483895430173.gal : 11 ms
[2022-05-19 23:35:26] [INFO ] Time to serialize properties into /tmp/LTL4116753449782305038.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/LTL16598373483895430173.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4116753449782305038.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/LTL1659837...267
Read 1 LTL properties
Checking formula 0 : !((X((F("(p1919==1)"))||(F((X(X((X("(p847==1)"))&&(X("(p2683==1)")))))&&("(p616==0)"))))))
Formula 0 simplified : !X(F"(p1919==1)" | F("(p616==0)" & XX(X"(p847==1)" & X"(p2683==1)")))
Detected timeout of ITS tools.
[2022-05-19 23:35:41] [INFO ] Flatten gal took : 53 ms
[2022-05-19 23:35:41] [INFO ] Applying decomposition
[2022-05-19 23:35:41] [INFO ] Flatten gal took : 53 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/graph3797354323020911829.txt' '-o' '/tmp/graph3797354323020911829.bin' '-w' '/tmp/graph3797354323020911829.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3797354323020911829.bin' '-l' '-1' '-v' '-w' '/tmp/graph3797354323020911829.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:35:41] [INFO ] Decomposing Gal with order
[2022-05-19 23:35:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:35:42] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:35:42] [INFO ] Flatten gal took : 103 ms
[2022-05-19 23:35:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 11 ms.
[2022-05-19 23:35:42] [INFO ] Time to serialize gal into /tmp/LTL1586568866131264541.gal : 35 ms
[2022-05-19 23:35:42] [INFO ] Time to serialize properties into /tmp/LTL14506420727601231095.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/LTL1586568866131264541.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14506420727601231095.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/LTL1586568...246
Read 1 LTL properties
Checking formula 0 : !((X((F("(i28.u674.p1919==1)"))||(F((X(X((X("(i12.i1.i0.u300.p847==1)"))&&(X("(i34.u945.p2683==1)")))))&&("(i9.u221.p616==0)"))))))
Formula 0 simplified : !X(F"(i28.u674.p1919==1)" | F("(i9.u221.p616==0)" & XX(X"(i12.i1.i0.u300.p847==1)" & X"(i34.u945.p2683==1)")))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3184066110586095979
[2022-05-19 23:35:57] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3184066110586095979
Running compilation step : cd /tmp/ltsmin3184066110586095979;'/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/ltsmin3184066110586095979;'/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/ltsmin3184066110586095979;'/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 ShieldPPPs-PT-040B-LTLFireability-09 finished in 173395 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(X((F(X(X(p0)))&&X(G(p1))))))))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2445 transition count 1965
Reduce places removed 280 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 282 rules applied. Total rules applied 562 place count 2165 transition count 1963
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 564 place count 2163 transition count 1963
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 564 place count 2163 transition count 1763
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 964 place count 1963 transition count 1763
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 968 place count 1959 transition count 1759
Iterating global reduction 3 with 4 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 972 place count 1959 transition count 1758
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 974 place count 1958 transition count 1758
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 1 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 3 with 1432 rules applied. Total rules applied 2406 place count 1242 transition count 1042
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2408 place count 1240 transition count 1040
Applied a total of 2408 rules in 587 ms. Remains 1240 /2446 variables (removed 1206) and now considering 1040/2246 (removed 1206) transitions.
// Phase 1: matrix 1040 rows 1240 cols
[2022-05-19 23:36:01] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:36:02] [INFO ] Implicit Places using invariants in 1174 ms returned []
// Phase 1: matrix 1040 rows 1240 cols
[2022-05-19 23:36:02] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:36:03] [INFO ] Implicit Places using invariants and state equation in 1208 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2022-05-19 23:36:03] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1040 rows 1240 cols
[2022-05-19 23:36:03] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:36:04] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1240/2446 places, 1040/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1240/2446 places, 1040/2246 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s812 1) (EQ s814 1)), p0:(AND (EQ s936 1) (EQ s938 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3619 steps with 1 reset in 30 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-10 finished in 3728 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&p1)))'
Support contains 3 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2442 transition count 2242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2442 transition count 2242
Applied a total of 8 rules in 241 ms. Remains 2442 /2446 variables (removed 4) and now considering 2242/2246 (removed 4) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:04] [INFO ] Computed 441 place invariants in 9 ms
[2022-05-19 23:36:05] [INFO ] Implicit Places using invariants in 792 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:05] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:36:07] [INFO ] Implicit Places using invariants and state equation in 2325 ms returned []
Implicit Place search using SMT with State Equation took 3142 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:07] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:36:08] [INFO ] Dead Transitions using invariants and state equation in 1340 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2442/2446 places, 2242/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2446 places, 2242/2246 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s587 1), p0:(AND (EQ s1152 1) (EQ s1154 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 33 reset in 772 ms.
Product exploration explored 100000 steps with 33 reset in 911 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2442 stabilizing places and 479/2242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 2755 steps, including 0 resets, run visited all 2 properties in 28 ms. (steps per millisecond=98 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 211 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 61 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:11] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:36:13] [INFO ] [Real]Absence check using 441 positive place invariants in 736 ms returned sat
[2022-05-19 23:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:36:26] [INFO ] [Real]Absence check using state equation in 12942 ms returned unknown
Could not prove EG (NOT p1)
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:26] [INFO ] Computed 441 place invariants in 10 ms
[2022-05-19 23:36:28] [INFO ] [Real]Absence check using 441 positive place invariants in 708 ms returned sat
[2022-05-19 23:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:36:41] [INFO ] [Real]Absence check using state equation in 12823 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 102 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:41] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:36:42] [INFO ] Implicit Places using invariants in 807 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:42] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:36:44] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 3067 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:44] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:36:45] [INFO ] Dead Transitions using invariants and state equation in 1370 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2442 places, 2242/2242 transitions.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/2442 stabilizing places and 479/2242 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 283 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 3221 steps, including 0 resets, run visited all 2 properties in 51 ms. (steps per millisecond=63 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 63 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:36:46] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:36:48] [INFO ] [Real]Absence check using 441 positive place invariants in 729 ms returned sat
[2022-05-19 23:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:37:01] [INFO ] [Real]Absence check using state equation in 12942 ms returned unknown
Could not prove EG (NOT p1)
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:37:01] [INFO ] Computed 441 place invariants in 8 ms
[2022-05-19 23:37:03] [INFO ] [Real]Absence check using 441 positive place invariants in 719 ms returned sat
[2022-05-19 23:37:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:37:16] [INFO ] [Real]Absence check using state equation in 12873 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 33 reset in 812 ms.
Product exploration explored 100000 steps with 33 reset in 894 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 66 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 2442 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2442 transition count 2242
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 81 Pre rules applied. Total rules applied 281 place count 2442 transition count 2243
Deduced a syphon composed of 362 places in 4 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 362 place count 2442 transition count 2243
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1199 places in 2 ms
Iterating global reduction 1 with 837 rules applied. Total rules applied 1199 place count 2442 transition count 2243
Renaming transitions due to excessive name length > 1024 char.
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 1481 place count 2160 transition count 1961
Deduced a syphon composed of 917 places in 1 ms
Iterating global reduction 1 with 282 rules applied. Total rules applied 1763 place count 2160 transition count 1961
Deduced a syphon composed of 917 places in 2 ms
Applied a total of 1763 rules in 530 ms. Remains 2160 /2442 variables (removed 282) and now considering 1961/2242 (removed 281) transitions.
[2022-05-19 23:37:19] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1961 rows 2160 cols
[2022-05-19 23:37:19] [INFO ] Computed 441 place invariants in 17 ms
[2022-05-19 23:37:20] [INFO ] Dead Transitions using invariants and state equation in 1169 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2160/2442 places, 1961/2242 transitions.
Finished structural reductions, in 1 iterations. Remains : 2160/2442 places, 1961/2242 transitions.
Product exploration explored 100000 steps with 52 reset in 782 ms.
Product exploration explored 100000 steps with 52 reset in 835 ms.
Built C files in :
/tmp/ltsmin15508263925899292986
[2022-05-19 23:37:22] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15508263925899292986
Running compilation step : cd /tmp/ltsmin15508263925899292986;'/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/ltsmin15508263925899292986;'/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/ltsmin15508263925899292986;'/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 2442 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2442/2442 places, 2242/2242 transitions.
Applied a total of 0 rules in 137 ms. Remains 2442 /2442 variables (removed 0) and now considering 2242/2242 (removed 0) transitions.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:37:25] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:37:27] [INFO ] Implicit Places using invariants in 1883 ms returned []
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:37:27] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:37:29] [INFO ] Implicit Places using invariants and state equation in 2270 ms returned []
Implicit Place search using SMT with State Equation took 4173 ms to find 0 implicit places.
// Phase 1: matrix 2242 rows 2442 cols
[2022-05-19 23:37:29] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:37:31] [INFO ] Dead Transitions using invariants and state equation in 1490 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2442/2442 places, 2242/2242 transitions.
Built C files in :
/tmp/ltsmin1876377033309243911
[2022-05-19 23:37:31] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1876377033309243911
Running compilation step : cd /tmp/ltsmin1876377033309243911;'/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/ltsmin1876377033309243911;'/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/ltsmin1876377033309243911;'/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-19 23:37:34] [INFO ] Flatten gal took : 101 ms
[2022-05-19 23:37:34] [INFO ] Flatten gal took : 75 ms
[2022-05-19 23:37:34] [INFO ] Time to serialize gal into /tmp/LTL1167966061257224320.gal : 15 ms
[2022-05-19 23:37:34] [INFO ] Time to serialize properties into /tmp/LTL11193576978220037782.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/LTL1167966061257224320.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11193576978220037782.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/LTL1167966...267
Read 1 LTL properties
Checking formula 0 : !((F((F(X("((p1278==1)&&(p1280==1))")))&&("(p650==1)"))))
Formula 0 simplified : !F("(p650==1)" & FX"((p1278==1)&&(p1280==1))")
Detected timeout of ITS tools.
[2022-05-19 23:37:49] [INFO ] Flatten gal took : 52 ms
[2022-05-19 23:37:49] [INFO ] Applying decomposition
[2022-05-19 23:37:49] [INFO ] Flatten gal took : 53 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/graph8723350762930822752.txt' '-o' '/tmp/graph8723350762930822752.bin' '-w' '/tmp/graph8723350762930822752.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8723350762930822752.bin' '-l' '-1' '-v' '-w' '/tmp/graph8723350762930822752.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:37:49] [INFO ] Decomposing Gal with order
[2022-05-19 23:37:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:37:50] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:37:50] [INFO ] Flatten gal took : 97 ms
[2022-05-19 23:37:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-05-19 23:37:50] [INFO ] Time to serialize gal into /tmp/LTL12800867895745557091.gal : 42 ms
[2022-05-19 23:37:50] [INFO ] Time to serialize properties into /tmp/LTL7631652790401522979.ltl : 24 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/LTL12800867895745557091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7631652790401522979.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/LTL1280086...246
Read 1 LTL properties
Checking formula 0 : !((F((F(X("((i19.i2.i0.u454.p1278==1)&&(i19.i2.i0.u455.p1280==1))")))&&("(i10.i0.i1.u233.p650==1)"))))
Formula 0 simplified : !F("(i10.i0.i1.u233.p650==1)" & FX"((i19.i2.i0.u454.p1278==1)&&(i19.i2.i0.u455.p1280==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5915849115334293805
[2022-05-19 23:38:05] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5915849115334293805
Running compilation step : cd /tmp/ltsmin5915849115334293805;'/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/ltsmin5915849115334293805;'/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/ltsmin5915849115334293805;'/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 ShieldPPPs-PT-040B-LTLFireability-11 finished in 124099 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Support contains 3 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2443 transition count 2243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2443 transition count 2243
Applied a total of 6 rules in 254 ms. Remains 2443 /2446 variables (removed 3) and now considering 2243/2246 (removed 3) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:08] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:38:10] [INFO ] Implicit Places using invariants in 1516 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:10] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:38:12] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 3808 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:12] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:38:13] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2443/2446 places, 2243/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2446 places, 2243/2246 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1987 0) (EQ s2021 0)), p0:(EQ s1643 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26 reset in 873 ms.
Product exploration explored 100000 steps with 29 reset in 952 ms.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Detected a total of 480/2443 stabilizing places and 480/2243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 256 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:16] [INFO ] Computed 441 place invariants in 12 ms
[2022-05-19 23:38:16] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:38:17] [INFO ] [Nat]Absence check using 441 positive place invariants in 139 ms returned sat
[2022-05-19 23:38:18] [INFO ] After 1059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:38:18] [INFO ] Deduced a trap composed of 22 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:38:19] [INFO ] Deduced a trap composed of 31 places in 514 ms of which 1 ms to minimize.
[2022-05-19 23:38:19] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 1 ms to minimize.
[2022-05-19 23:38:20] [INFO ] Deduced a trap composed of 46 places in 486 ms of which 1 ms to minimize.
[2022-05-19 23:38:21] [INFO ] Deduced a trap composed of 53 places in 486 ms of which 1 ms to minimize.
[2022-05-19 23:38:21] [INFO ] Deduced a trap composed of 22 places in 472 ms of which 1 ms to minimize.
[2022-05-19 23:38:22] [INFO ] Deduced a trap composed of 20 places in 463 ms of which 1 ms to minimize.
[2022-05-19 23:38:22] [INFO ] Deduced a trap composed of 17 places in 482 ms of which 1 ms to minimize.
[2022-05-19 23:38:23] [INFO ] Deduced a trap composed of 40 places in 469 ms of which 1 ms to minimize.
[2022-05-19 23:38:23] [INFO ] Deduced a trap composed of 29 places in 468 ms of which 2 ms to minimize.
[2022-05-19 23:38:24] [INFO ] Deduced a trap composed of 24 places in 461 ms of which 1 ms to minimize.
[2022-05-19 23:38:24] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 1 ms to minimize.
[2022-05-19 23:38:25] [INFO ] Deduced a trap composed of 26 places in 485 ms of which 1 ms to minimize.
[2022-05-19 23:38:26] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2022-05-19 23:38:26] [INFO ] Deduced a trap composed of 20 places in 461 ms of which 1 ms to minimize.
[2022-05-19 23:38:27] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 1 ms to minimize.
[2022-05-19 23:38:27] [INFO ] Deduced a trap composed of 37 places in 451 ms of which 1 ms to minimize.
[2022-05-19 23:38:28] [INFO ] Deduced a trap composed of 24 places in 466 ms of which 1 ms to minimize.
[2022-05-19 23:38:28] [INFO ] Deduced a trap composed of 20 places in 494 ms of which 1 ms to minimize.
[2022-05-19 23:38:29] [INFO ] Deduced a trap composed of 36 places in 455 ms of which 2 ms to minimize.
[2022-05-19 23:38:29] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 1 ms to minimize.
[2022-05-19 23:38:30] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 1 ms to minimize.
[2022-05-19 23:38:30] [INFO ] Deduced a trap composed of 34 places in 422 ms of which 1 ms to minimize.
[2022-05-19 23:38:31] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 1 ms to minimize.
[2022-05-19 23:38:31] [INFO ] Deduced a trap composed of 32 places in 414 ms of which 1 ms to minimize.
[2022-05-19 23:38:32] [INFO ] Deduced a trap composed of 28 places in 394 ms of which 1 ms to minimize.
[2022-05-19 23:38:32] [INFO ] Deduced a trap composed of 27 places in 408 ms of which 1 ms to minimize.
[2022-05-19 23:38:33] [INFO ] Deduced a trap composed of 26 places in 405 ms of which 1 ms to minimize.
[2022-05-19 23:38:33] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 1 ms to minimize.
[2022-05-19 23:38:34] [INFO ] Deduced a trap composed of 32 places in 373 ms of which 1 ms to minimize.
[2022-05-19 23:38:34] [INFO ] Deduced a trap composed of 52 places in 368 ms of which 1 ms to minimize.
[2022-05-19 23:38:35] [INFO ] Deduced a trap composed of 30 places in 370 ms of which 1 ms to minimize.
[2022-05-19 23:38:35] [INFO ] Deduced a trap composed of 52 places in 371 ms of which 1 ms to minimize.
[2022-05-19 23:38:35] [INFO ] Deduced a trap composed of 22 places in 364 ms of which 1 ms to minimize.
[2022-05-19 23:38:36] [INFO ] Deduced a trap composed of 28 places in 374 ms of which 1 ms to minimize.
[2022-05-19 23:38:36] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 1 ms to minimize.
[2022-05-19 23:38:37] [INFO ] Deduced a trap composed of 40 places in 351 ms of which 1 ms to minimize.
[2022-05-19 23:38:37] [INFO ] Deduced a trap composed of 39 places in 353 ms of which 1 ms to minimize.
[2022-05-19 23:38:38] [INFO ] Deduced a trap composed of 37 places in 353 ms of which 1 ms to minimize.
[2022-05-19 23:38:38] [INFO ] Deduced a trap composed of 42 places in 364 ms of which 1 ms to minimize.
[2022-05-19 23:38:38] [INFO ] Deduced a trap composed of 27 places in 344 ms of which 1 ms to minimize.
[2022-05-19 23:38:39] [INFO ] Deduced a trap composed of 50 places in 343 ms of which 1 ms to minimize.
[2022-05-19 23:38:39] [INFO ] Deduced a trap composed of 41 places in 364 ms of which 0 ms to minimize.
[2022-05-19 23:38:40] [INFO ] Deduced a trap composed of 28 places in 351 ms of which 1 ms to minimize.
[2022-05-19 23:38:40] [INFO ] Deduced a trap composed of 46 places in 346 ms of which 0 ms to minimize.
[2022-05-19 23:38:41] [INFO ] Deduced a trap composed of 32 places in 352 ms of which 1 ms to minimize.
[2022-05-19 23:38:41] [INFO ] Deduced a trap composed of 44 places in 340 ms of which 1 ms to minimize.
[2022-05-19 23:38:41] [INFO ] Deduced a trap composed of 43 places in 389 ms of which 1 ms to minimize.
[2022-05-19 23:38:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:38:41] [INFO ] After 25227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 21 ms.
Support contains 3 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2443 transition count 1962
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1962 transition count 1762
Performed 718 Post agglomeration using F-continuation condition.Transition count delta: 718
Deduced a syphon composed of 718 places in 2 ms
Reduce places removed 718 places and 0 transitions.
Iterating global reduction 2 with 1436 rules applied. Total rules applied 2398 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 356 times.
Drop transitions removed 356 transitions
Iterating global reduction 2 with 356 rules applied. Total rules applied 2754 place count 1244 transition count 1044
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2755 place count 1243 transition count 1043
Applied a total of 2755 rules in 288 ms. Remains 1243 /2443 variables (removed 1200) and now considering 1043/2243 (removed 1200) transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/2443 places, 1043/2243 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 1) seen :0
Finished Best-First random walk after 6345 steps, including 1 resets, run visited all 1 properties in 31 ms. (steps per millisecond=204 )
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Applied a total of 0 rules in 114 ms. Remains 2443 /2443 variables (removed 0) and now considering 2243/2243 (removed 0) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:42] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:38:43] [INFO ] Implicit Places using invariants in 789 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:43] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:38:46] [INFO ] Implicit Places using invariants and state equation in 2317 ms returned []
Implicit Place search using SMT with State Equation took 3137 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:46] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:38:47] [INFO ] Dead Transitions using invariants and state equation in 1325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2243/2243 transitions.
Computed a total of 480 stabilizing places and 480 stable transitions
Computed a total of 480 stabilizing places and 480 stable transitions
Detected a total of 480/2443 stabilizing places and 480/2243 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:38:47] [INFO ] Computed 441 place invariants in 11 ms
[2022-05-19 23:38:48] [INFO ] After 251ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:38:48] [INFO ] [Nat]Absence check using 441 positive place invariants in 137 ms returned sat
[2022-05-19 23:38:49] [INFO ] After 1052ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:38:50] [INFO ] Deduced a trap composed of 22 places in 487 ms of which 1 ms to minimize.
[2022-05-19 23:38:50] [INFO ] Deduced a trap composed of 31 places in 508 ms of which 1 ms to minimize.
[2022-05-19 23:38:51] [INFO ] Deduced a trap composed of 27 places in 503 ms of which 2 ms to minimize.
[2022-05-19 23:38:51] [INFO ] Deduced a trap composed of 46 places in 484 ms of which 1 ms to minimize.
[2022-05-19 23:38:52] [INFO ] Deduced a trap composed of 53 places in 462 ms of which 1 ms to minimize.
[2022-05-19 23:38:53] [INFO ] Deduced a trap composed of 22 places in 475 ms of which 1 ms to minimize.
[2022-05-19 23:38:53] [INFO ] Deduced a trap composed of 20 places in 471 ms of which 1 ms to minimize.
[2022-05-19 23:38:54] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 1 ms to minimize.
[2022-05-19 23:38:54] [INFO ] Deduced a trap composed of 40 places in 466 ms of which 1 ms to minimize.
[2022-05-19 23:38:55] [INFO ] Deduced a trap composed of 29 places in 456 ms of which 1 ms to minimize.
[2022-05-19 23:38:55] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 1 ms to minimize.
[2022-05-19 23:38:56] [INFO ] Deduced a trap composed of 27 places in 529 ms of which 1 ms to minimize.
[2022-05-19 23:38:56] [INFO ] Deduced a trap composed of 26 places in 506 ms of which 2 ms to minimize.
[2022-05-19 23:38:57] [INFO ] Deduced a trap composed of 17 places in 464 ms of which 1 ms to minimize.
[2022-05-19 23:38:58] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 1 ms to minimize.
[2022-05-19 23:38:58] [INFO ] Deduced a trap composed of 21 places in 462 ms of which 1 ms to minimize.
[2022-05-19 23:38:59] [INFO ] Deduced a trap composed of 37 places in 455 ms of which 2 ms to minimize.
[2022-05-19 23:38:59] [INFO ] Deduced a trap composed of 24 places in 470 ms of which 1 ms to minimize.
[2022-05-19 23:39:00] [INFO ] Deduced a trap composed of 20 places in 450 ms of which 1 ms to minimize.
[2022-05-19 23:39:00] [INFO ] Deduced a trap composed of 36 places in 464 ms of which 1 ms to minimize.
[2022-05-19 23:39:01] [INFO ] Deduced a trap composed of 33 places in 451 ms of which 1 ms to minimize.
[2022-05-19 23:39:01] [INFO ] Deduced a trap composed of 34 places in 453 ms of which 1 ms to minimize.
[2022-05-19 23:39:02] [INFO ] Deduced a trap composed of 34 places in 416 ms of which 1 ms to minimize.
[2022-05-19 23:39:02] [INFO ] Deduced a trap composed of 33 places in 402 ms of which 1 ms to minimize.
[2022-05-19 23:39:03] [INFO ] Deduced a trap composed of 32 places in 382 ms of which 1 ms to minimize.
[2022-05-19 23:39:03] [INFO ] Deduced a trap composed of 28 places in 422 ms of which 1 ms to minimize.
[2022-05-19 23:39:04] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 1 ms to minimize.
[2022-05-19 23:39:04] [INFO ] Deduced a trap composed of 26 places in 377 ms of which 1 ms to minimize.
[2022-05-19 23:39:05] [INFO ] Deduced a trap composed of 35 places in 377 ms of which 1 ms to minimize.
[2022-05-19 23:39:05] [INFO ] Deduced a trap composed of 32 places in 378 ms of which 1 ms to minimize.
[2022-05-19 23:39:05] [INFO ] Deduced a trap composed of 52 places in 388 ms of which 1 ms to minimize.
[2022-05-19 23:39:06] [INFO ] Deduced a trap composed of 30 places in 368 ms of which 1 ms to minimize.
[2022-05-19 23:39:06] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 1 ms to minimize.
[2022-05-19 23:39:07] [INFO ] Deduced a trap composed of 22 places in 391 ms of which 1 ms to minimize.
[2022-05-19 23:39:07] [INFO ] Deduced a trap composed of 28 places in 362 ms of which 1 ms to minimize.
[2022-05-19 23:39:08] [INFO ] Deduced a trap composed of 25 places in 349 ms of which 1 ms to minimize.
[2022-05-19 23:39:08] [INFO ] Deduced a trap composed of 40 places in 357 ms of which 1 ms to minimize.
[2022-05-19 23:39:09] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 0 ms to minimize.
[2022-05-19 23:39:09] [INFO ] Deduced a trap composed of 37 places in 344 ms of which 1 ms to minimize.
[2022-05-19 23:39:09] [INFO ] Deduced a trap composed of 42 places in 376 ms of which 1 ms to minimize.
[2022-05-19 23:39:10] [INFO ] Deduced a trap composed of 27 places in 352 ms of which 0 ms to minimize.
[2022-05-19 23:39:10] [INFO ] Deduced a trap composed of 50 places in 350 ms of which 1 ms to minimize.
[2022-05-19 23:39:11] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 1 ms to minimize.
[2022-05-19 23:39:11] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 1 ms to minimize.
[2022-05-19 23:39:12] [INFO ] Deduced a trap composed of 46 places in 343 ms of which 1 ms to minimize.
[2022-05-19 23:39:12] [INFO ] Deduced a trap composed of 32 places in 379 ms of which 1 ms to minimize.
[2022-05-19 23:39:12] [INFO ] Deduced a trap composed of 44 places in 357 ms of which 1 ms to minimize.
[2022-05-19 23:39:13] [INFO ] Deduced a trap composed of 43 places in 331 ms of which 1 ms to minimize.
[2022-05-19 23:39:13] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-19 23:39:13] [INFO ] After 25198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2443 transition count 1962
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2162 transition count 1962
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2162 transition count 1762
Deduced a syphon composed of 200 places in 8 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1962 transition count 1762
Performed 718 Post agglomeration using F-continuation condition.Transition count delta: 718
Deduced a syphon composed of 718 places in 1 ms
Reduce places removed 718 places and 0 transitions.
Iterating global reduction 2 with 1436 rules applied. Total rules applied 2398 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 356 times.
Drop transitions removed 356 transitions
Iterating global reduction 2 with 356 rules applied. Total rules applied 2754 place count 1244 transition count 1044
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2755 place count 1243 transition count 1043
Applied a total of 2755 rules in 270 ms. Remains 1243 /2443 variables (removed 1200) and now considering 1043/2243 (removed 1200) transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/2443 places, 1043/2243 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13781 steps, run visited all 1 properties in 210 ms. (steps per millisecond=65 )
Probabilistic random walk after 13781 steps, saw 12343 distinct states, run finished after 211 ms. (steps per millisecond=65 ) properties seen :1
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 37 reset in 754 ms.
Product exploration explored 100000 steps with 31 reset in 962 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2443 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Performed 280 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 2443 transition count 2243
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 82 Pre rules applied. Total rules applied 280 place count 2443 transition count 2245
Deduced a syphon composed of 362 places in 4 ms
Iterating global reduction 1 with 82 rules applied. Total rules applied 362 place count 2443 transition count 2245
Performed 837 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1199 places in 2 ms
Iterating global reduction 1 with 837 rules applied. Total rules applied 1199 place count 2443 transition count 2245
Renaming transitions due to excessive name length > 1024 char.
Discarding 280 places :
Symmetric choice reduction at 1 with 280 rule applications. Total rules 1479 place count 2163 transition count 1965
Deduced a syphon composed of 919 places in 1 ms
Iterating global reduction 1 with 280 rules applied. Total rules applied 1759 place count 2163 transition count 1965
Deduced a syphon composed of 919 places in 3 ms
Applied a total of 1759 rules in 573 ms. Remains 2163 /2443 variables (removed 280) and now considering 1965/2243 (removed 278) transitions.
[2022-05-19 23:39:17] [INFO ] Redundant transitions in 44 ms returned []
// Phase 1: matrix 1965 rows 2163 cols
[2022-05-19 23:39:17] [INFO ] Computed 441 place invariants in 16 ms
[2022-05-19 23:39:18] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2163/2443 places, 1965/2243 transitions.
Finished structural reductions, in 1 iterations. Remains : 2163/2443 places, 1965/2243 transitions.
Product exploration explored 100000 steps with 32 reset in 811 ms.
Product exploration explored 100000 steps with 35 reset in 973 ms.
Built C files in :
/tmp/ltsmin9102140649912567801
[2022-05-19 23:39:20] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9102140649912567801
Running compilation step : cd /tmp/ltsmin9102140649912567801;'/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/ltsmin9102140649912567801;'/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/ltsmin9102140649912567801;'/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 2443 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2443/2443 places, 2243/2243 transitions.
Applied a total of 0 rules in 122 ms. Remains 2443 /2443 variables (removed 0) and now considering 2243/2243 (removed 0) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:39:23] [INFO ] Computed 441 place invariants in 7 ms
[2022-05-19 23:39:24] [INFO ] Implicit Places using invariants in 1489 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:39:24] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:39:27] [INFO ] Implicit Places using invariants and state equation in 2287 ms returned []
Implicit Place search using SMT with State Equation took 3789 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:39:27] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:39:28] [INFO ] Dead Transitions using invariants and state equation in 1315 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2443 places, 2243/2243 transitions.
Built C files in :
/tmp/ltsmin1364393807523405067
[2022-05-19 23:39:28] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1364393807523405067
Running compilation step : cd /tmp/ltsmin1364393807523405067;'/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/ltsmin1364393807523405067;'/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/ltsmin1364393807523405067;'/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-19 23:39:31] [INFO ] Flatten gal took : 102 ms
[2022-05-19 23:39:31] [INFO ] Flatten gal took : 139 ms
[2022-05-19 23:39:31] [INFO ] Time to serialize gal into /tmp/LTL1237514041763095491.gal : 38 ms
[2022-05-19 23:39:31] [INFO ] Time to serialize properties into /tmp/LTL2549353936533434317.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/LTL1237514041763095491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2549353936533434317.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/LTL1237514...266
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(p1826==0)"))||(F("((p2210==0)||(p2250==0))")))))))
Formula 0 simplified : !XXG(X"(p1826==0)" | F"((p2210==0)||(p2250==0))")
Detected timeout of ITS tools.
[2022-05-19 23:39:47] [INFO ] Flatten gal took : 68 ms
[2022-05-19 23:39:47] [INFO ] Applying decomposition
[2022-05-19 23:39:47] [INFO ] Flatten gal took : 53 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/graph14234319412158865228.txt' '-o' '/tmp/graph14234319412158865228.bin' '-w' '/tmp/graph14234319412158865228.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14234319412158865228.bin' '-l' '-1' '-v' '-w' '/tmp/graph14234319412158865228.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:39:47] [INFO ] Decomposing Gal with order
[2022-05-19 23:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:39:47] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:39:47] [INFO ] Flatten gal took : 121 ms
[2022-05-19 23:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2022-05-19 23:39:47] [INFO ] Time to serialize gal into /tmp/LTL11589991742185819366.gal : 52 ms
[2022-05-19 23:39:47] [INFO ] Time to serialize properties into /tmp/LTL18075965482733126103.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/LTL11589991742185819366.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18075965482733126103.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/LTL1158999...247
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i26.u649.p1826==0)"))||(F("((i32.i1.i0.u784.p2210==0)||(i32.i1.i1.u796.p2250==0))")))))))
Formula 0 simplified : !XXG(X"(i26.u649.p1826==0)" | F"((i32.i1.i0.u784.p2210==0)||(i32.i1.i1.u796.p2250==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18253222426987399781
[2022-05-19 23:40:02] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18253222426987399781
Running compilation step : cd /tmp/ltsmin18253222426987399781;'/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/ltsmin18253222426987399781;'/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/ltsmin18253222426987399781;'/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 ShieldPPPs-PT-040B-LTLFireability-12 finished in 117564 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(X(p0)))||X(p1)||G(p2)))'
Support contains 4 out of 2446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2443 transition count 2243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2443 transition count 2243
Applied a total of 6 rules in 248 ms. Remains 2443 /2446 variables (removed 3) and now considering 2243/2246 (removed 3) transitions.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:40:06] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:40:07] [INFO ] Implicit Places using invariants in 1483 ms returned []
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:40:07] [INFO ] Computed 441 place invariants in 6 ms
[2022-05-19 23:40:10] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 3945 ms to find 0 implicit places.
// Phase 1: matrix 2243 rows 2443 cols
[2022-05-19 23:40:10] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:40:11] [INFO ] Dead Transitions using invariants and state equation in 1308 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2443/2446 places, 2243/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 2443/2446 places, 2243/2246 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (EQ s177 1) (EQ s200 1) (EQ s1130 1)), p0:(EQ s2298 1), p2:(EQ s1130 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]]
Stuttering criterion allowed to conclude after 6223 steps with 0 reset in 56 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-040B-LTLFireability-14 finished in 5742 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(((X(p1) U p2)&&p0)) U (p1 U p3)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(p0))))'
Found a CL insensitive property : ShieldPPPs-PT-040B-LTLFireability-08
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2164 transition count 1764
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1964 transition count 1764
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 966 place count 1960 transition count 1760
Iterating global reduction 2 with 4 rules applied. Total rules applied 970 place count 1960 transition count 1760
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 970 place count 1960 transition count 1759
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 715 Post agglomeration using F-continuation condition.Transition count delta: 715
Deduced a syphon composed of 715 places in 1 ms
Reduce places removed 715 places and 0 transitions.
Iterating global reduction 2 with 1430 rules applied. Total rules applied 2402 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2404 place count 1242 transition count 1042
Applied a total of 2404 rules in 394 ms. Remains 1242 /2446 variables (removed 1204) and now considering 1042/2246 (removed 1204) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:12] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:40:12] [INFO ] Implicit Places using invariants in 626 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:12] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:40:14] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:14] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:40:14] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1242/2446 places, 1042/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2446 places, 1042/2246 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s68 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 43 reset in 858 ms.
Product exploration explored 100000 steps with 42 reset in 1013 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 2359 steps, including 0 resets, run visited all 1 properties in 21 ms. (steps per millisecond=112 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:16] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:40:17] [INFO ] [Real]Absence check using 441 positive place invariants in 258 ms returned sat
[2022-05-19 23:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:40:20] [INFO ] [Real]Absence check using state equation in 2720 ms returned sat
[2022-05-19 23:40:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:40:21] [INFO ] [Nat]Absence check using 441 positive place invariants in 267 ms returned sat
[2022-05-19 23:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:40:24] [INFO ] [Nat]Absence check using state equation in 2567 ms returned sat
[2022-05-19 23:40:24] [INFO ] Computed and/alt/rep : 1039/1996/1039 causal constraints (skipped 0 transitions) in 46 ms.
[2022-05-19 23:40:35] [INFO ] Added : 530 causal constraints over 106 iterations in 11423 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 31 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:35] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:40:36] [INFO ] Implicit Places using invariants in 557 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:36] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:40:37] [INFO ] Implicit Places using invariants and state equation in 1151 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
[2022-05-19 23:40:37] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:37] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:40:38] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/1242 places, 1042/1042 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 2068 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=103 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:40:38] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:40:39] [INFO ] [Real]Absence check using 441 positive place invariants in 252 ms returned sat
[2022-05-19 23:40:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:40:42] [INFO ] [Real]Absence check using state equation in 2710 ms returned sat
[2022-05-19 23:40:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:40:43] [INFO ] [Nat]Absence check using 441 positive place invariants in 275 ms returned sat
[2022-05-19 23:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:40:45] [INFO ] [Nat]Absence check using state equation in 2602 ms returned sat
[2022-05-19 23:40:45] [INFO ] Computed and/alt/rep : 1039/1996/1039 causal constraints (skipped 0 transitions) in 47 ms.
[2022-05-19 23:40:57] [INFO ] Added : 525 causal constraints over 105 iterations in 11366 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 42 reset in 847 ms.
Product exploration explored 100000 steps with 42 reset in 987 ms.
Built C files in :
/tmp/ltsmin15954574574069585399
[2022-05-19 23:40:58] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2022-05-19 23:40:58] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:40:58] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2022-05-19 23:40:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:40:59] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2022-05-19 23:40:59] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:40:59] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15954574574069585399
Running compilation step : cd /tmp/ltsmin15954574574069585399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 3001 ms.
Running link step : cd /tmp/ltsmin15954574574069585399;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15954574574069585399;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18253904523794310609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 39 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:41:14] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:41:14] [INFO ] Implicit Places using invariants in 532 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:41:14] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:41:15] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1683 ms to find 0 implicit places.
[2022-05-19 23:41:15] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:41:15] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:41:16] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/1242 places, 1042/1042 transitions.
Built C files in :
/tmp/ltsmin15197977545142861292
[2022-05-19 23:41:16] [INFO ] Computing symmetric may disable matrix : 1042 transitions.
[2022-05-19 23:41:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:41:16] [INFO ] Computing symmetric may enable matrix : 1042 transitions.
[2022-05-19 23:41:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:41:16] [INFO ] Computing Do-Not-Accords matrix : 1042 transitions.
[2022-05-19 23:41:16] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 23:41:16] [INFO ] Built C files in 95ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15197977545142861292
Running compilation step : cd /tmp/ltsmin15197977545142861292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2959 ms.
Running link step : cd /tmp/ltsmin15197977545142861292;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin15197977545142861292;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11314588804223833599.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:41:31] [INFO ] Flatten gal took : 30 ms
[2022-05-19 23:41:31] [INFO ] Flatten gal took : 30 ms
[2022-05-19 23:41:31] [INFO ] Time to serialize gal into /tmp/LTL14225241897236043302.gal : 3 ms
[2022-05-19 23:41:31] [INFO ] Time to serialize properties into /tmp/LTL7081084809473217307.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/LTL14225241897236043302.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7081084809473217307.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/LTL1422524...267
Read 1 LTL properties
Checking formula 0 : !((F(X(F("((p191==1)&&(p216==1))")))))
Formula 0 simplified : !FXF"((p191==1)&&(p216==1))"
Detected timeout of ITS tools.
[2022-05-19 23:41:46] [INFO ] Flatten gal took : 43 ms
[2022-05-19 23:41:46] [INFO ] Applying decomposition
[2022-05-19 23:41:46] [INFO ] Flatten gal took : 30 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/graph6039775964207453339.txt' '-o' '/tmp/graph6039775964207453339.bin' '-w' '/tmp/graph6039775964207453339.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6039775964207453339.bin' '-l' '-1' '-v' '-w' '/tmp/graph6039775964207453339.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:41:46] [INFO ] Decomposing Gal with order
[2022-05-19 23:41:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:41:46] [INFO ] Removed a total of 242 redundant transitions.
[2022-05-19 23:41:46] [INFO ] Flatten gal took : 46 ms
[2022-05-19 23:41:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 478 labels/synchronizations in 10 ms.
[2022-05-19 23:41:46] [INFO ] Time to serialize gal into /tmp/LTL8961911215871057209.gal : 9 ms
[2022-05-19 23:41:46] [INFO ] Time to serialize properties into /tmp/LTL16301573203941356217.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/LTL8961911215871057209.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16301573203941356217.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/LTL8961911...246
Read 1 LTL properties
Checking formula 0 : !((F(X(F("((i2.i0.u24.p191==1)&&(i2.i2.u32.p216==1))")))))
Formula 0 simplified : !FXF"((i2.i0.u24.p191==1)&&(i2.i2.u32.p216==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11149445517881691851
[2022-05-19 23:42:01] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11149445517881691851
Running compilation step : cd /tmp/ltsmin11149445517881691851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1765 ms.
Running link step : cd /tmp/ltsmin11149445517881691851;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11149445517881691851;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>((LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 7110 ms.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-08 finished in 119031 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||F((X(X((X(p1)&&X(p2))))&&p3)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(X(p0))&&p1)))'
Found a CL insensitive property : ShieldPPPs-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 282 rules applied. Total rules applied 563 place count 2164 transition count 1963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 564 place count 2163 transition count 1963
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 564 place count 2163 transition count 1763
Deduced a syphon composed of 200 places in 4 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 964 place count 1963 transition count 1763
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 968 place count 1959 transition count 1759
Iterating global reduction 3 with 4 rules applied. Total rules applied 972 place count 1959 transition count 1759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 972 place count 1959 transition count 1758
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 974 place count 1958 transition count 1758
Performed 714 Post agglomeration using F-continuation condition.Transition count delta: 714
Deduced a syphon composed of 714 places in 2 ms
Reduce places removed 714 places and 0 transitions.
Iterating global reduction 3 with 1428 rules applied. Total rules applied 2402 place count 1244 transition count 1044
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2404 place count 1242 transition count 1042
Applied a total of 2404 rules in 383 ms. Remains 1242 /2446 variables (removed 1204) and now considering 1042/2246 (removed 1204) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:11] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:42:11] [INFO ] Implicit Places using invariants in 568 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:11] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:42:13] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:13] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:42:13] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1242/2446 places, 1042/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/2446 places, 1042/2246 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s282 1), p0:(AND (EQ s576 1) (EQ s578 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 85 reset in 867 ms.
Product exploration explored 100000 steps with 86 reset in 1019 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1242 stabilizing places and 2/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 220 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1043 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=86 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:16] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:42:17] [INFO ] [Real]Absence check using 441 positive place invariants in 272 ms returned sat
[2022-05-19 23:42:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:42:21] [INFO ] [Real]Absence check using state equation in 3813 ms returned sat
[2022-05-19 23:42:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:42:22] [INFO ] [Nat]Absence check using 441 positive place invariants in 268 ms returned sat
[2022-05-19 23:42:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:42:25] [INFO ] [Nat]Absence check using state equation in 2916 ms returned sat
[2022-05-19 23:42:25] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2022-05-19 23:42:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2022-05-19 23:42:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2022-05-19 23:42:25] [INFO ] Computed and/alt/rep : 1039/2008/1039 causal constraints (skipped 0 transitions) in 50 ms.
[2022-05-19 23:42:36] [INFO ] Deduced a trap composed of 2 places in 513 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 23:42:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:36] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:42:37] [INFO ] [Real]Absence check using 441 positive place invariants in 275 ms returned sat
[2022-05-19 23:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:42:41] [INFO ] [Real]Absence check using state equation in 3392 ms returned sat
[2022-05-19 23:42:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:42:42] [INFO ] [Nat]Absence check using 441 positive place invariants in 272 ms returned sat
[2022-05-19 23:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:42:45] [INFO ] [Nat]Absence check using state equation in 3035 ms returned sat
[2022-05-19 23:42:45] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2022-05-19 23:42:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2022-05-19 23:42:45] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 1 ms to minimize.
[2022-05-19 23:42:45] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2022-05-19 23:42:45] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 0 ms to minimize.
[2022-05-19 23:42:46] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2022-05-19 23:42:46] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 1 ms to minimize.
[2022-05-19 23:42:46] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 0 ms to minimize.
[2022-05-19 23:42:46] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-05-19 23:42:47] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2022-05-19 23:42:47] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 0 ms to minimize.
[2022-05-19 23:42:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2000 ms
[2022-05-19 23:42:47] [INFO ] Computed and/alt/rep : 1039/2008/1039 causal constraints (skipped 0 transitions) in 52 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:348)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 23:42:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 24 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:56] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:42:56] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:56] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:42:57] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1701 ms to find 0 implicit places.
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:57] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:42:58] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/1242 places, 1042/1042 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1242 stabilizing places and 2/1042 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1096 steps, including 0 resets, run visited all 2 properties in 15 ms. (steps per millisecond=73 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:42:59] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:43:00] [INFO ] [Real]Absence check using 441 positive place invariants in 284 ms returned sat
[2022-05-19 23:43:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:43:03] [INFO ] [Real]Absence check using state equation in 3742 ms returned sat
[2022-05-19 23:43:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:43:04] [INFO ] [Nat]Absence check using 441 positive place invariants in 260 ms returned sat
[2022-05-19 23:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:43:07] [INFO ] [Nat]Absence check using state equation in 2876 ms returned sat
[2022-05-19 23:43:07] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2022-05-19 23:43:08] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2022-05-19 23:43:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2022-05-19 23:43:08] [INFO ] Computed and/alt/rep : 1039/2008/1039 causal constraints (skipped 0 transitions) in 57 ms.
[2022-05-19 23:43:19] [INFO ] Deduced a trap composed of 2 places in 543 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:521)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:677)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:652)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:356)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runSLCLLTLTest(LTLPropertySolver.java:277)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:687)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-19 23:43:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:43:19] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:43:20] [INFO ] [Real]Absence check using 441 positive place invariants in 293 ms returned sat
[2022-05-19 23:43:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 23:43:24] [INFO ] [Real]Absence check using state equation in 3473 ms returned sat
[2022-05-19 23:43:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 23:43:25] [INFO ] [Nat]Absence check using 441 positive place invariants in 294 ms returned sat
[2022-05-19 23:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 23:43:28] [INFO ] [Nat]Absence check using state equation in 3173 ms returned sat
[2022-05-19 23:43:28] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2022-05-19 23:43:28] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2022-05-19 23:43:28] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2022-05-19 23:43:28] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2022-05-19 23:43:28] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 0 ms to minimize.
[2022-05-19 23:43:29] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2022-05-19 23:43:29] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2022-05-19 23:43:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-05-19 23:43:29] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2022-05-19 23:43:29] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 0 ms to minimize.
[2022-05-19 23:43:30] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-05-19 23:43:30] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1709 ms
[2022-05-19 23:43:30] [INFO ] Computed and/alt/rep : 1039/2008/1039 causal constraints (skipped 0 transitions) in 44 ms.
[2022-05-19 23:43:39] [INFO ] Added : 425 causal constraints over 85 iterations in 9086 ms. Result :unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 86 reset in 872 ms.
Product exploration explored 100000 steps with 84 reset in 1022 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Support contains 3 out of 1242 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1242/1242 places, 1042/1042 transitions.
Applied a total of 0 rules in 34 ms. Remains 1242 /1242 variables (removed 0) and now considering 1042/1042 (removed 0) transitions.
[2022-05-19 23:43:41] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1042 rows 1242 cols
[2022-05-19 23:43:41] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:43:41] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1242/1242 places, 1042/1042 transitions.
Product exploration explored 100000 steps with 86 reset in 868 ms.
Product exploration explored 100000 steps with 87 reset in 1024 ms.
Built C files in :
/tmp/ltsmin11333274762643479810
[2022-05-19 23:43:43] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11333274762643479810
Running compilation step : cd /tmp/ltsmin11333274762643479810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1975 ms.
Running link step : cd /tmp/ltsmin11333274762643479810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11333274762643479810;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15170235581396534578.hoa' '--buchi-type=spotba'
LTSmin run took 3491 ms.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-11 finished in 98516 ms.
CL/SL decision was in the wrong direction : CL + false
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Found a SL insensitive property : ShieldPPPs-PT-040B-LTLFireability-12
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 2446 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 2446/2446 places, 2246/2246 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 2445 transition count 1964
Reduce places removed 281 places and 0 transitions.
Iterating post reduction 1 with 281 rules applied. Total rules applied 562 place count 2164 transition count 1964
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 562 place count 2164 transition count 1764
Deduced a syphon composed of 200 places in 3 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 962 place count 1964 transition count 1764
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 965 place count 1961 transition count 1761
Iterating global reduction 2 with 3 rules applied. Total rules applied 968 place count 1961 transition count 1761
Performed 716 Post agglomeration using F-continuation condition.Transition count delta: 716
Deduced a syphon composed of 716 places in 2 ms
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 2 with 1432 rules applied. Total rules applied 2400 place count 1245 transition count 1045
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 2402 place count 1243 transition count 1043
Applied a total of 2402 rules in 332 ms. Remains 1243 /2446 variables (removed 1203) and now considering 1043/2246 (removed 1203) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:49] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:43:50] [INFO ] Implicit Places using invariants in 556 ms returned []
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:50] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:43:51] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned []
Implicit Place search using SMT with State Equation took 1696 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:51] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:43:52] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 1243/2446 places, 1043/2246 transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/2446 places, 1043/2246 transitions.
Running random walk in product with property : ShieldPPPs-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s1007 0) (EQ s1027 0)), p0:(EQ s830 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 82 reset in 803 ms.
Product exploration explored 100000 steps with 87 reset in 968 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1243 stabilizing places and 2/1043 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:54] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:43:54] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:43:54] [INFO ] [Nat]Absence check using 441 positive place invariants in 68 ms returned sat
[2022-05-19 23:43:55] [INFO ] After 419ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:43:55] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 0 ms to minimize.
[2022-05-19 23:43:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2022-05-19 23:43:55] [INFO ] After 598ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-19 23:43:55] [INFO ] After 864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 108 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 32 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:56] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:43:56] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:56] [INFO ] Computed 441 place invariants in 2 ms
[2022-05-19 23:43:57] [INFO ] Implicit Places using invariants and state equation in 1185 ms returned []
Implicit Place search using SMT with State Equation took 1722 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:57] [INFO ] Computed 441 place invariants in 4 ms
[2022-05-19 23:43:58] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 1043/1043 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/1243 stabilizing places and 2/1043 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:43:58] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:43:59] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 23:43:59] [INFO ] [Nat]Absence check using 441 positive place invariants in 67 ms returned sat
[2022-05-19 23:43:59] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 23:43:59] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 0 ms to minimize.
[2022-05-19 23:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2022-05-19 23:43:59] [INFO ] After 597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-05-19 23:43:59] [INFO ] After 865ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 108 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p1 p0), true, (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 5 states, 6 edges and 2 AP to 5 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 78 reset in 808 ms.
Product exploration explored 100000 steps with 75 reset in 975 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 36 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
[2022-05-19 23:44:02] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:44:02] [INFO ] Computed 441 place invariants in 5 ms
[2022-05-19 23:44:03] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 1043/1043 transitions.
Product exploration explored 100000 steps with 70 reset in 903 ms.
Product exploration explored 100000 steps with 65 reset in 1072 ms.
Built C files in :
/tmp/ltsmin9451657337943088410
[2022-05-19 23:44:05] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9451657337943088410
Running compilation step : cd /tmp/ltsmin9451657337943088410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1856 ms.
Running link step : cd /tmp/ltsmin9451657337943088410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9451657337943088410;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4035590409796273880.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1243/1243 places, 1043/1043 transitions.
Applied a total of 0 rules in 31 ms. Remains 1243 /1243 variables (removed 0) and now considering 1043/1043 (removed 0) transitions.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:44:20] [INFO ] Computed 441 place invariants in 3 ms
[2022-05-19 23:44:20] [INFO ] Implicit Places using invariants in 561 ms returned []
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:44:20] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:44:22] [INFO ] Implicit Places using invariants and state equation in 1235 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
// Phase 1: matrix 1043 rows 1243 cols
[2022-05-19 23:44:22] [INFO ] Computed 441 place invariants in 1 ms
[2022-05-19 23:44:22] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1243/1243 places, 1043/1043 transitions.
Built C files in :
/tmp/ltsmin2834061707829894086
[2022-05-19 23:44:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2834061707829894086
Running compilation step : cd /tmp/ltsmin2834061707829894086;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1894 ms.
Running link step : cd /tmp/ltsmin2834061707829894086;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2834061707829894086;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3265865158499683749.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 23:44:37] [INFO ] Flatten gal took : 31 ms
[2022-05-19 23:44:37] [INFO ] Flatten gal took : 31 ms
[2022-05-19 23:44:37] [INFO ] Time to serialize gal into /tmp/LTL7819987452984387839.gal : 2 ms
[2022-05-19 23:44:37] [INFO ] Time to serialize properties into /tmp/LTL10562932128889709702.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/LTL7819987452984387839.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10562932128889709702.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/LTL7819987...267
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(p1826==0)"))||(F("((p2210==0)||(p2250==0))")))))))
Formula 0 simplified : !XXG(X"(p1826==0)" | F"((p2210==0)||(p2250==0))")
Detected timeout of ITS tools.
[2022-05-19 23:44:52] [INFO ] Flatten gal took : 31 ms
[2022-05-19 23:44:52] [INFO ] Applying decomposition
[2022-05-19 23:44:53] [INFO ] Flatten gal took : 38 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/graph16630640386294616896.txt' '-o' '/tmp/graph16630640386294616896.bin' '-w' '/tmp/graph16630640386294616896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16630640386294616896.bin' '-l' '-1' '-v' '-w' '/tmp/graph16630640386294616896.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:44:53] [INFO ] Decomposing Gal with order
[2022-05-19 23:44:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:44:53] [INFO ] Removed a total of 242 redundant transitions.
[2022-05-19 23:44:53] [INFO ] Flatten gal took : 48 ms
[2022-05-19 23:44:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 482 labels/synchronizations in 11 ms.
[2022-05-19 23:44:53] [INFO ] Time to serialize gal into /tmp/LTL2080026858693362203.gal : 6 ms
[2022-05-19 23:44:53] [INFO ] Time to serialize properties into /tmp/LTL12256329320654732437.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/LTL2080026858693362203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12256329320654732437.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/LTL2080026...246
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i26.u295.p1826==0)"))||(F("((i32.i0.i1.u359.p2210==0)||(i32.i1.i1.u365.p2250==0))")))))))
Formula 0 simplified : !XXG(X"(i26.u295.p1826==0)" | F"((i32.i0.i1.u359.p2210==0)||(i32.i1.i1.u365.p2250==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13544508198364304458
[2022-05-19 23:45:08] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13544508198364304458
Running compilation step : cd /tmp/ltsmin13544508198364304458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1924 ms.
Running link step : cd /tmp/ltsmin13544508198364304458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13544508198364304458;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp0==true))||<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldPPPs-PT-040B-LTLFireability-12 finished in 93992 ms.
[2022-05-19 23:45:23] [INFO ] Flatten gal took : 53 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7375418741793612143
[2022-05-19 23:45:23] [INFO ] Too many transitions (2246) to apply POR reductions. Disabling POR matrices.
[2022-05-19 23:45:23] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7375418741793612143
Running compilation step : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' '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-19 23:45:23] [INFO ] Applying decomposition
[2022-05-19 23:45:23] [INFO ] Flatten gal took : 53 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/graph10960484593207345110.txt' '-o' '/tmp/graph10960484593207345110.bin' '-w' '/tmp/graph10960484593207345110.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10960484593207345110.bin' '-l' '-1' '-v' '-w' '/tmp/graph10960484593207345110.weights' '-q' '0' '-e' '0.001'
[2022-05-19 23:45:23] [INFO ] Decomposing Gal with order
[2022-05-19 23:45:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 23:45:23] [INFO ] Removed a total of 360 redundant transitions.
[2022-05-19 23:45:23] [INFO ] Flatten gal took : 92 ms
[2022-05-19 23:45:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-05-19 23:45:24] [INFO ] Time to serialize gal into /tmp/LTLFireability2944474418645671762.gal : 18 ms
[2022-05-19 23:45:24] [INFO ] Time to serialize properties into /tmp/LTLFireability8056149831597339922.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/LTLFireability2944474418645671762.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8056149831597339922.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 6 LTL properties
Checking formula 0 : !((G(F("(i23.i0.i0.u541.p1529==1)"))))
Formula 0 simplified : !GF"(i23.i0.i0.u541.p1529==1)"
Compilation finished in 4857 ms.
Running link step : cd /tmp/ltsmin7375418741793612143;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(!X(((X((LTLAPp2==true)) U (LTLAPp3==true))&&(LTLAPp1==true))) U ((LTLAPp2==true) U (LTLAPp4==true)))' '--buchi-type=spotba'
LTSmin run took 16435 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(<>((LTLAPp5==true))))' '--buchi-type=spotba'
LTSmin run took 16573 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp6==true))||<>((X(X((X((LTLAPp7==true))&&X((LTLAPp8==true)))))&&(LTLAPp9==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((<>((LTLAPp6==true))||<>((X(X((X((LTLAPp7==true))&&X((LTLAPp8==true)))))&&(LTLAPp9==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((<>(X((LTLAPp10==true)))&&(LTLAPp11==true)))' '--buchi-type=spotba'
LTSmin run took 17149 ms.
FORMULA ShieldPPPs-PT-040B-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp12==true))||<>((LTLAPp13==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-20 00:11:58] [INFO ] Applying decomposition
[2022-05-20 00:11:58] [INFO ] Flatten gal took : 163 ms
[2022-05-20 00:11:58] [INFO ] Decomposing Gal with order
[2022-05-20 00:11:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 00:11:59] [INFO ] Removed a total of 240 redundant transitions.
[2022-05-20 00:11:59] [INFO ] Flatten gal took : 207 ms
[2022-05-20 00:12:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 480 labels/synchronizations in 46 ms.
[2022-05-20 00:12:00] [INFO ] Time to serialize gal into /tmp/LTLFireability14069641404056737122.gal : 31 ms
[2022-05-20 00:12:00] [INFO ] Time to serialize properties into /tmp/LTLFireability16027185688928721392.ltl : 19 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/LTLFireability14069641404056737122.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16027185688928721392.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...269
Read 3 LTL properties
Checking formula 0 : !((G(F("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u1094.p1529==1)"))))
Formula 0 simplified : !GF"(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u1094.p1529==1)"
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((X((LTLAPp12==true))||<>((LTLAPp13==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin7375418741793612143;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'

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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ShieldPPPs-PT-040B"
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 ShieldPPPs-PT-040B, 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-165286025300492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-040B.tgz
mv ShieldPPPs-PT-040B 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 ;