Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r109-tall-171624208600448.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DES-PT-40a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208600448
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 83K May 18 16:42 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 DES-PT-40a-LTLFireability-00
FORMULA_NAME DES-PT-40a-LTLFireability-01
FORMULA_NAME DES-PT-40a-LTLFireability-02
FORMULA_NAME DES-PT-40a-LTLFireability-03
FORMULA_NAME DES-PT-40a-LTLFireability-04
FORMULA_NAME DES-PT-40a-LTLFireability-05
FORMULA_NAME DES-PT-40a-LTLFireability-06
FORMULA_NAME DES-PT-40a-LTLFireability-07
FORMULA_NAME DES-PT-40a-LTLFireability-08
FORMULA_NAME DES-PT-40a-LTLFireability-09
FORMULA_NAME DES-PT-40a-LTLFireability-10
FORMULA_NAME DES-PT-40a-LTLFireability-11
FORMULA_NAME DES-PT-40a-LTLFireability-12
FORMULA_NAME DES-PT-40a-LTLFireability-13
FORMULA_NAME DES-PT-40a-LTLFireability-14
FORMULA_NAME DES-PT-40a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716338177042

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-22 00:36:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:36:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:36:18] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-22 00:36:18] [INFO ] Transformed 274 places.
[2024-05-22 00:36:18] [INFO ] Transformed 231 transitions.
[2024-05-22 00:36:18] [INFO ] Found NUPN structural information;
[2024-05-22 00:36:18] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 240 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 6 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 273 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 216
Applied a total of 2 rules in 43 ms. Remains 273 /274 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 273 cols
[2024-05-22 00:36:19] [INFO ] Computed 59 invariants in 31 ms
[2024-05-22 00:36:19] [INFO ] Implicit Places using invariants in 330 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 272/274 places, 216/217 transitions.
Applied a total of 0 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 272/274 places, 216/217 transitions.
Support contains 36 out of 272 places after structural reductions.
[2024-05-22 00:36:19] [INFO ] Flatten gal took : 49 ms
[2024-05-22 00:36:19] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:36:19] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 228 resets, run finished after 460 ms. (steps per millisecond=21 ) properties (out of 28) seen :10
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 00:36:20] [INFO ] Computed 58 invariants in 8 ms
[2024-05-22 00:36:20] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:36:20] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2024-05-22 00:36:20] [INFO ] After 300ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-22 00:36:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2024-05-22 00:36:20] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2024-05-22 00:36:21] [INFO ] After 866ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-22 00:36:22] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
[2024-05-22 00:36:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2024-05-22 00:36:22] [INFO ] After 1774ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 662 ms.
[2024-05-22 00:36:23] [INFO ] After 2788ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Fused 18 Parikh solutions to 17 different solutions.
Parikh walk visited 14 properties in 889 ms.
Support contains 10 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 272 transition count 214
Applied a total of 6 rules in 28 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 809904 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 809904 steps, saw 115681 distinct states, run finished after 3002 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:36:27] [INFO ] Computed 60 invariants in 6 ms
[2024-05-22 00:36:27] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:36:27] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 00:36:27] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 00:36:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:36:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 102 ms returned sat
[2024-05-22 00:36:28] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 00:36:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:36:28] [INFO ] After 184ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-22 00:36:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2024-05-22 00:36:28] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 177 ms.
[2024-05-22 00:36:29] [INFO ] After 1133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 217 ms.
Support contains 10 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 00:36:29] [INFO ] Invariant cache hit.
[2024-05-22 00:36:29] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 00:36:29] [INFO ] Invariant cache hit.
[2024-05-22 00:36:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 00:36:29] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2024-05-22 00:36:29] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-22 00:36:29] [INFO ] Invariant cache hit.
[2024-05-22 00:36:29] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-22 00:36:29] [INFO ] Invariant cache hit.
[2024-05-22 00:36:29] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:36:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2024-05-22 00:36:30] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 00:36:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:36:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 84 ms returned sat
[2024-05-22 00:36:30] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-22 00:36:30] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 167 ms.
[2024-05-22 00:36:30] [INFO ] After 833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 175 stabilizing places and 170 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(p2)&&p1)||(X(p4)&&p3))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 00:36:31] [INFO ] Computed 58 invariants in 7 ms
[2024-05-22 00:36:31] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 00:36:31] [INFO ] Invariant cache hit.
[2024-05-22 00:36:31] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-22 00:36:31] [INFO ] Invariant cache hit.
[2024-05-22 00:36:31] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 557 ms. Remains : 272/272 places, 216/216 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 541 ms :[true, (NOT p2), (NOT p4), (AND (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p4)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p4))]
Running random walk in product with property : DES-PT-40a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p4), acceptance={} source=2 dest: 0}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) p3), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=5 dest: 7}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 8}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=5 dest: 9}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=7 dest: 0}, { cond=(AND p0 (NOT p4)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4)), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p4)), acceptance={} source=9 dest: 8}]], initial=4, aps=[p2:(AND (EQ s170 1) (EQ s263 1)), p4:(AND (EQ s75 1) (EQ s267 1)), p0:(OR (EQ s170 0) (EQ s263 0)), p1:(AND (EQ s75 1) (EQ s267 1)), p3:(AND (EQ s170 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA DES-PT-40a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-00 finished in 1159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 14 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:36:32] [INFO ] Invariant cache hit.
[2024-05-22 00:36:32] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 00:36:32] [INFO ] Invariant cache hit.
[2024-05-22 00:36:32] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-22 00:36:32] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 00:36:32] [INFO ] Invariant cache hit.
[2024-05-22 00:36:32] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 579 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-02 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 s114 1) (EQ s188 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 68 steps with 0 reset in 2 ms.
FORMULA DES-PT-40a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-02 finished in 645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||(F(p1) U !p2)))))'
Support contains 5 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:36:33] [INFO ] Invariant cache hit.
[2024-05-22 00:36:33] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 00:36:33] [INFO ] Invariant cache hit.
[2024-05-22 00:36:33] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-22 00:36:33] [INFO ] Invariant cache hit.
[2024-05-22 00:36:33] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 577 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : DES-PT-40a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s191 1) (EQ s193 1)), p2:(AND (EQ s117 1) (EQ s188 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 50000 reset in 488 ms.
Product exploration explored 100000 steps with 50000 reset in 435 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/272 stabilizing places and 170/216 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 34 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40a-LTLFireability-03 finished in 1712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p1)&&G(p2)&&p0)))'
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:36:34] [INFO ] Invariant cache hit.
[2024-05-22 00:36:34] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-22 00:36:34] [INFO ] Invariant cache hit.
[2024-05-22 00:36:35] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-22 00:36:35] [INFO ] Invariant cache hit.
[2024-05-22 00:36:35] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}]], initial=1, aps=[p2:(OR (EQ s23 0) (EQ s191 0) (EQ s193 0)), p0:(AND (EQ s23 1) (EQ s191 1) (EQ s193 1)), p1:(AND (EQ s49 1) (EQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-07 finished in 859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(G(p1) U X((p2||G(p0)))))))'
Support contains 6 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:36:35] [INFO ] Invariant cache hit.
[2024-05-22 00:36:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 00:36:35] [INFO ] Invariant cache hit.
[2024-05-22 00:36:36] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2024-05-22 00:36:36] [INFO ] Invariant cache hit.
[2024-05-22 00:36:36] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 636 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s107 1) (EQ s188 1)), p2:(AND (EQ s248 1) (EQ s251 1) (EQ s55 1) (EQ s267 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]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 2 ms.
FORMULA DES-PT-40a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-08 finished in 776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(F(p0)&&F((p1||G(!p2))))))))'
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:36:36] [INFO ] Invariant cache hit.
[2024-05-22 00:36:36] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 00:36:36] [INFO ] Invariant cache hit.
[2024-05-22 00:36:36] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-22 00:36:36] [INFO ] Invariant cache hit.
[2024-05-22 00:36:36] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : DES-PT-40a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s198 1) (EQ s215 1)), p1:(AND (EQ s218 1) (EQ s234 1)), p2:(AND (EQ s165 1) (EQ s186 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 152 steps with 3 reset in 2 ms.
FORMULA DES-PT-40a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-11 finished in 835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:36:37] [INFO ] Invariant cache hit.
[2024-05-22 00:36:37] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-22 00:36:37] [INFO ] Invariant cache hit.
[2024-05-22 00:36:37] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-22 00:36:37] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 00:36:37] [INFO ] Invariant cache hit.
[2024-05-22 00:36:37] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 582 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : DES-PT-40a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s122 1) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2235 reset in 247 ms.
Product exploration explored 100000 steps with 2230 reset in 244 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[p0]
Incomplete random walk after 10000 steps, including 224 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 64 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1584475 steps, run timeout after 3001 ms. (steps per millisecond=527 ) properties seen :{}
Probabilistic random walk after 1584475 steps, saw 219397 distinct states, run finished after 3001 ms. (steps per millisecond=527 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:36:41] [INFO ] Invariant cache hit.
[2024-05-22 00:36:41] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:36:41] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-22 00:36:41] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:42] [INFO ] After 229ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2024-05-22 00:36:42] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 27 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1497657 steps, run timeout after 3001 ms. (steps per millisecond=499 ) properties seen :{}
Probabilistic random walk after 1497657 steps, saw 208876 distinct states, run finished after 3001 ms. (steps per millisecond=499 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:36:45] [INFO ] Computed 60 invariants in 12 ms
[2024-05-22 00:36:45] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:45] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:36:45] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:45] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:45] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2024-05-22 00:36:45] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:36:45] [INFO ] After 32ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:45] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-22 00:36:45] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 00:36:45] [INFO ] Invariant cache hit.
[2024-05-22 00:36:45] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 00:36:45] [INFO ] Invariant cache hit.
[2024-05-22 00:36:46] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:36:46] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-05-22 00:36:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 00:36:46] [INFO ] Invariant cache hit.
[2024-05-22 00:36:46] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 828 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 13 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:36:46] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:36:46] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:46] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:36:46] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:46] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:46] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 55 ms returned sat
[2024-05-22 00:36:46] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:47] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-22 00:36:47] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 37 ms :[p0]
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 11 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 00:36:47] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:36:47] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 00:36:47] [INFO ] Invariant cache hit.
[2024-05-22 00:36:47] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-22 00:36:47] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:36:47] [INFO ] Invariant cache hit.
[2024-05-22 00:36:47] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 692 ms. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[p0]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1516542 steps, run timeout after 3001 ms. (steps per millisecond=505 ) properties seen :{}
Probabilistic random walk after 1516542 steps, saw 211174 distinct states, run finished after 3001 ms. (steps per millisecond=505 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 00:36:51] [INFO ] Invariant cache hit.
[2024-05-22 00:36:51] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-22 00:36:51] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2024-05-22 00:36:51] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:51] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 56 ms returned sat
[2024-05-22 00:36:51] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:51] [INFO ] After 260ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-22 00:36:51] [INFO ] After 474ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 34 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1522443 steps, run timeout after 3001 ms. (steps per millisecond=507 ) properties seen :{}
Probabilistic random walk after 1522443 steps, saw 212908 distinct states, run finished after 3001 ms. (steps per millisecond=507 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:36:54] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:36:54] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:36:54] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:55] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:55] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2024-05-22 00:36:55] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:36:55] [INFO ] After 28ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:55] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-22 00:36:55] [INFO ] After 395ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 00:36:55] [INFO ] Invariant cache hit.
[2024-05-22 00:36:55] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 00:36:55] [INFO ] Invariant cache hit.
[2024-05-22 00:36:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:36:55] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-22 00:36:55] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:36:55] [INFO ] Invariant cache hit.
[2024-05-22 00:36:56] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 735 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 17 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:36:56] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:36:56] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2024-05-22 00:36:56] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-05-22 00:36:56] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 00:36:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:36:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 69 ms returned sat
[2024-05-22 00:36:56] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 00:36:56] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-05-22 00:36:56] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p0]
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 57 ms :[p0]
Product exploration explored 100000 steps with 2224 reset in 205 ms.
Product exploration explored 100000 steps with 2225 reset in 248 ms.
Built C files in :
/tmp/ltsmin10640499742646788014
[2024-05-22 00:36:57] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-22 00:36:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:36:57] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-22 00:36:57] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:36:57] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-22 00:36:57] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:36:57] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10640499742646788014
Running compilation step : cd /tmp/ltsmin10640499742646788014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 582 ms.
Running link step : cd /tmp/ltsmin10640499742646788014;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10640499742646788014;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15546332935742647706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 16 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 00:37:12] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 00:37:12] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 00:37:12] [INFO ] Invariant cache hit.
[2024-05-22 00:37:13] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
[2024-05-22 00:37:13] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:37:13] [INFO ] Invariant cache hit.
[2024-05-22 00:37:13] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 592 ms. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin7144296933608824912
[2024-05-22 00:37:13] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-22 00:37:13] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:13] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-22 00:37:13] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:13] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-22 00:37:13] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:37:13] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7144296933608824912
Running compilation step : cd /tmp/ltsmin7144296933608824912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 453 ms.
Running link step : cd /tmp/ltsmin7144296933608824912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7144296933608824912;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13211608357721006573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:37:28] [INFO ] Time to serialize gal into /tmp/LTL13334521331786815861.gal : 4 ms
[2024-05-22 00:37:28] [INFO ] Time to serialize properties into /tmp/LTL15013236387461010052.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13334521331786815861.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8490152802675142461.hoa' '-atoms' '/tmp/LTL15013236387461010052.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL15013236387461010052.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8490152802675142461.hoa
Detected timeout of ITS tools.
[2024-05-22 00:37:43] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:37:43] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:37:43] [INFO ] Time to serialize gal into /tmp/LTL7520989337709807469.gal : 2 ms
[2024-05-22 00:37:43] [INFO ] Time to serialize properties into /tmp/LTL10387604244038499496.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7520989337709807469.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10387604244038499496.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((p122!=1)||(p164!=1))"))))
Formula 0 simplified : GF!"((p122!=1)||(p164!=1))"
Detected timeout of ITS tools.
[2024-05-22 00:37:58] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:37:58] [INFO ] Applying decomposition
[2024-05-22 00:37:58] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14274383132782923631.txt' '-o' '/tmp/graph14274383132782923631.bin' '-w' '/tmp/graph14274383132782923631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14274383132782923631.bin' '-l' '-1' '-v' '-w' '/tmp/graph14274383132782923631.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:37:59] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:59] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:37:59] [INFO ] Flatten gal took : 110 ms
[2024-05-22 00:37:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-22 00:37:59] [INFO ] Time to serialize gal into /tmp/LTL145092208368236037.gal : 16 ms
[2024-05-22 00:37:59] [INFO ] Time to serialize properties into /tmp/LTL7768495430563081870.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL145092208368236037.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7768495430563081870.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G("((u2.p122!=1)||(u2.p164!=1))"))))
Formula 0 simplified : GF!"((u2.p122!=1)||(u2.p164!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4941075518918683769
[2024-05-22 00:38:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4941075518918683769
Running compilation step : cd /tmp/ltsmin4941075518918683769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 373 ms.
Running link step : cd /tmp/ltsmin4941075518918683769;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4941075518918683769;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLFireability-12 finished in 112238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(p1 U p2)))'
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:38:29] [INFO ] Invariant cache hit.
[2024-05-22 00:38:29] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 00:38:29] [INFO ] Invariant cache hit.
[2024-05-22 00:38:29] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-22 00:38:30] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:38:30] [INFO ] Invariant cache hit.
[2024-05-22 00:38:30] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-40a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s11 1) (EQ s191 1) (EQ s193 1)), p1:(OR (AND (EQ s156 1) (EQ s164 1)) (AND (EQ s109 1) (EQ s188 1))), p0:(AND (EQ s156 1) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-13 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U X(p1))&&X(X((G(p3)&&p2))))))'
Support contains 5 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:38:30] [INFO ] Invariant cache hit.
[2024-05-22 00:38:30] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 00:38:30] [INFO ] Invariant cache hit.
[2024-05-22 00:38:30] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2024-05-22 00:38:30] [INFO ] Invariant cache hit.
[2024-05-22 00:38:30] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 536 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 363 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (OR (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p3)), true, (NOT p3), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 p3), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p3), acceptance={} source=7 dest: 6}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s170 1) (EQ s263 1)), p1:(AND (EQ s60 1) (EQ s267 1)), p2:(AND (EQ s52 1) (EQ s267 1)), p3:(AND (EQ s52 1) (EQ s267 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, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 8 reset in 1 ms.
FORMULA DES-PT-40a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLFireability-14 finished in 934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(p1))&&p0) U (!p2&&F(!p3))))))'
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 9 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 00:38:31] [INFO ] Invariant cache hit.
[2024-05-22 00:38:31] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 00:38:31] [INFO ] Invariant cache hit.
[2024-05-22 00:38:31] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-22 00:38:31] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:38:31] [INFO ] Invariant cache hit.
[2024-05-22 00:38:31] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 610 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR p2 p3), p3, (AND p3 (NOT p1)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p2 p3)]
Running random walk in product with property : DES-PT-40a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=p3, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p3 p1), acceptance={1} source=2 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 1}, { cond=(AND p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s147 1) (EQ s164 1)), p0:(AND (EQ s124 1) (EQ s164 1)), p3:(AND (EQ s137 1) (EQ s164 1)), p1:(AND (EQ s210 1) (EQ s227 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 2226 reset in 236 ms.
Product exploration explored 100000 steps with 2239 reset in 299 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p3)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p3 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 208 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 5 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR p2 p3), p3, (AND p3 (NOT p1)), (OR (AND (NOT p1) p3) (AND (NOT p1) p2)), (OR p3 p2)]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-22 00:38:33] [INFO ] Invariant cache hit.
[2024-05-22 00:38:33] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 00:38:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 25 ms returned sat
[2024-05-22 00:38:33] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 00:38:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:38:33] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 76 ms returned sat
[2024-05-22 00:38:34] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :8
[2024-05-22 00:38:34] [INFO ] After 633ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :8
Attempting to minimize the solution found.
Minimization took 205 ms.
[2024-05-22 00:38:34] [INFO ] After 1088ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :8
Fused 10 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 144 ms.
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 22 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 139 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 430608 steps, run timeout after 3001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 430608 steps, saw 63064 distinct states, run finished after 3001 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:38:38] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:38:39] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 00:38:39] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 44 ms returned sat
[2024-05-22 00:38:39] [INFO ] After 190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 00:38:39] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:38:39] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2024-05-22 00:38:39] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 00:38:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:38:39] [INFO ] After 246ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-05-22 00:38:40] [INFO ] After 527ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 201 ms.
[2024-05-22 00:38:40] [INFO ] After 1258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 104 ms.
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 00:38:40] [INFO ] Invariant cache hit.
[2024-05-22 00:38:40] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 00:38:40] [INFO ] Invariant cache hit.
[2024-05-22 00:38:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:38:40] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-22 00:38:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:38:41] [INFO ] Invariant cache hit.
[2024-05-22 00:38:41] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 709 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 12 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:38:41] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:38:41] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:38:41] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-05-22 00:38:41] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 00:38:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 00:38:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 57 ms returned sat
[2024-05-22 00:38:41] [INFO ] After 321ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-05-22 00:38:42] [INFO ] After 644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-05-22 00:38:42] [INFO ] After 1057ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT (AND p2 p1))), (X (NOT p3)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (OR (NOT p2) p0)), (X (NOT (AND p2 p0))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p3))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (NOT p2) p0))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p3 p1)))), (G (NOT (AND p0 p2))), (G (NOT (AND p0 p2 p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p2) p1))]
Knowledge based reduction with 23 factoid took 343 ms. Reduced automaton from 5 states, 17 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 64 ms :[(OR p2 p3), p3]
Support contains 3 out of 272 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 00:38:42] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 00:38:43] [INFO ] Implicit Places using invariants in 290 ms returned []
[2024-05-22 00:38:43] [INFO ] Invariant cache hit.
[2024-05-22 00:38:43] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-22 00:38:43] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:38:43] [INFO ] Invariant cache hit.
[2024-05-22 00:38:43] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 750 ms. Remains : 272/272 places, 216/216 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 88 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(OR p2 p3), p3]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 858823 steps, run timeout after 3003 ms. (steps per millisecond=285 ) properties seen :{}
Probabilistic random walk after 858823 steps, saw 127223 distinct states, run finished after 3003 ms. (steps per millisecond=285 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 00:38:47] [INFO ] Invariant cache hit.
[2024-05-22 00:38:47] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:38:47] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-22 00:38:47] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:38:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 00:38:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 65 ms returned sat
[2024-05-22 00:38:47] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:38:47] [INFO ] After 355ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-05-22 00:38:47] [INFO ] After 629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 272 transition count 214
Applied a total of 7 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 214/216 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 272/272 places, 214/216 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 946552 steps, run timeout after 3001 ms. (steps per millisecond=315 ) properties seen :{}
Probabilistic random walk after 946552 steps, saw 134575 distinct states, run finished after 3001 ms. (steps per millisecond=315 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:38:51] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:38:51] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:38:51] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2024-05-22 00:38:51] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:38:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 00:38:51] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2024-05-22 00:38:52] [INFO ] After 768ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:38:52] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:38:52] [INFO ] After 434ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-22 00:38:52] [INFO ] After 647ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 480 ms.
[2024-05-22 00:38:53] [INFO ] After 2088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 39 ms.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 272/272 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2024-05-22 00:38:53] [INFO ] Invariant cache hit.
[2024-05-22 00:38:53] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-22 00:38:53] [INFO ] Invariant cache hit.
[2024-05-22 00:38:53] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 00:38:53] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
[2024-05-22 00:38:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:38:53] [INFO ] Invariant cache hit.
[2024-05-22 00:38:54] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 785 ms. Remains : 272/272 places, 214/214 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 272 transition count 214
Applied a total of 1 rules in 8 ms. Remains 272 /272 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 214 rows 272 cols
[2024-05-22 00:38:54] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:38:54] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2024-05-22 00:38:54] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2024-05-22 00:38:54] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 00:38:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2024-05-22 00:38:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2024-05-22 00:38:55] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-22 00:38:55] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:38:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 00:38:55] [INFO ] After 853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-22 00:38:55] [INFO ] After 1262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p3)), (X (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p3))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 81 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 61 ms :[(OR p2 p3), p3]
Stuttering acceptance computed with spot in 76 ms :[(OR p2 p3), p3]
Product exploration explored 100000 steps with 2239 reset in 271 ms.
Product exploration explored 100000 steps with 2224 reset in 248 ms.
Built C files in :
/tmp/ltsmin1463916299759338955
[2024-05-22 00:38:56] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-22 00:38:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:56] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-22 00:38:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:56] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-22 00:38:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:38:56] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1463916299759338955
Running compilation step : cd /tmp/ltsmin1463916299759338955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 437 ms.
Running link step : cd /tmp/ltsmin1463916299759338955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1463916299759338955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15954385599411556771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 19 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 00:39:11] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 00:39:11] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-22 00:39:11] [INFO ] Invariant cache hit.
[2024-05-22 00:39:11] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2024-05-22 00:39:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:39:11] [INFO ] Invariant cache hit.
[2024-05-22 00:39:12] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 589 ms. Remains : 272/272 places, 216/216 transitions.
Built C files in :
/tmp/ltsmin15134145843442883720
[2024-05-22 00:39:12] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-22 00:39:12] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:39:12] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-22 00:39:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:39:12] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-22 00:39:12] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:39:12] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15134145843442883720
Running compilation step : cd /tmp/ltsmin15134145843442883720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 458 ms.
Running link step : cd /tmp/ltsmin15134145843442883720;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15134145843442883720;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5899264611186342725.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:39:27] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:39:27] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:39:27] [INFO ] Time to serialize gal into /tmp/LTL903398777596299686.gal : 2 ms
[2024-05-22 00:39:27] [INFO ] Time to serialize properties into /tmp/LTL1167724894792427586.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL903398777596299686.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1067172877880279619.hoa' '-atoms' '/tmp/LTL1167724894792427586.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL1167724894792427586.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1067172877880279619.hoa
Detected timeout of ITS tools.
[2024-05-22 00:39:42] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:39:42] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:39:42] [INFO ] Time to serialize gal into /tmp/LTL2983186647109565342.gal : 2 ms
[2024-05-22 00:39:42] [INFO ] Time to serialize properties into /tmp/LTL10427112613719938923.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2983186647109565342.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10427112613719938923.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G((("((p124==1)&&(p164==1))")&&(F(G("((p211==1)&&(p228==1))"))))U((!("((p147==1)&&(p164==1))"))&&(F(!("((p137==1)&&(p164==1))")))...160
Formula 0 simplified : GF((!"((p124==1)&&(p164==1))" | GF!"((p211==1)&&(p228==1))") R ("((p147==1)&&(p164==1))" | G"((p137==1)&&(p164==1))"))
Detected timeout of ITS tools.
[2024-05-22 00:39:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:39:57] [INFO ] Applying decomposition
[2024-05-22 00:39:57] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8205898358514567007.txt' '-o' '/tmp/graph8205898358514567007.bin' '-w' '/tmp/graph8205898358514567007.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8205898358514567007.bin' '-l' '-1' '-v' '-w' '/tmp/graph8205898358514567007.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:39:57] [INFO ] Decomposing Gal with order
[2024-05-22 00:39:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:39:57] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:39:57] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:39:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2024-05-22 00:39:57] [INFO ] Time to serialize gal into /tmp/LTL837014169241531031.gal : 3 ms
[2024-05-22 00:39:57] [INFO ] Time to serialize properties into /tmp/LTL3685502603926613500.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL837014169241531031.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3685502603926613500.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G((("((u2.p124==1)&&(u2.p164==1))")&&(F(G("((i7.i1.u23.p211==1)&&(i7.i1.u31.p228==1))"))))U((!("((u2.p147==1)&&(u2.p164==1))"))&&...198
Formula 0 simplified : GF((!"((u2.p124==1)&&(u2.p164==1))" | GF!"((i7.i1.u23.p211==1)&&(i7.i1.u31.p228==1))") R ("((u2.p147==1)&&(u2.p164==1))" | G"((u2.p1...179
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11582204131081156885
[2024-05-22 00:40:12] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11582204131081156885
Running compilation step : cd /tmp/ltsmin11582204131081156885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 367 ms.
Running link step : cd /tmp/ltsmin11582204131081156885;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11582204131081156885;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([](((<>([]((LTLAPp1==true)))&&(LTLAPp0==true)) U (!(LTLAPp2==true)&&<>(!(LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40a-LTLFireability-15 finished in 116441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(G(p1))&&p0) U (!p2&&F(!p3))))))'
[2024-05-22 00:40:27] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17701718549600138018
[2024-05-22 00:40:27] [INFO ] Computing symmetric may disable matrix : 216 transitions.
[2024-05-22 00:40:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:40:27] [INFO ] Applying decomposition
[2024-05-22 00:40:27] [INFO ] Computing symmetric may enable matrix : 216 transitions.
[2024-05-22 00:40:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:40:27] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:40:27] [INFO ] Computing Do-Not-Accords matrix : 216 transitions.
[2024-05-22 00:40:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:40:27] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17701718549600138018
Running compilation step : cd /tmp/ltsmin17701718549600138018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5868892931085351946.txt' '-o' '/tmp/graph5868892931085351946.bin' '-w' '/tmp/graph5868892931085351946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5868892931085351946.bin' '-l' '-1' '-v' '-w' '/tmp/graph5868892931085351946.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:40:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:40:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:40:28] [INFO ] Removed a total of 47 redundant transitions.
[2024-05-22 00:40:28] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:40:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 3 ms.
[2024-05-22 00:40:28] [INFO ] Time to serialize gal into /tmp/LTLFireability10526784194203103293.gal : 3 ms
[2024-05-22 00:40:28] [INFO ] Time to serialize properties into /tmp/LTLFireability9295529989032540613.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10526784194203103293.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9295529989032540613.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 2 LTL properties
Checking formula 0 : !((F(G(!("((u2.p122==1)&&(u2.p164==1))")))))
Formula 0 simplified : GF"((u2.p122==1)&&(u2.p164==1))"
Compilation finished in 513 ms.
Running link step : cd /tmp/ltsmin17701718549600138018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17701718549600138018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t176, t177, t209, u2.t8, u2.t90, u2.t94, u2.t95, u2.t96, u2.t97, u2.t98, u2.t99, u2.t100,...654
Computing Next relation with stutter on 3.63306e+06 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
35439 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,354.428,3270244,1,0,9.26352e+06,102768,730,9.43781e+06,1185,636423,1532485
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-40a-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(G((("((u2.p124==1)&&(u2.p164==1))")&&(F(G("((i7.u24.p211==1)&&(i7.u32.p228==1))"))))U((!("((u2.p147==1)&&(u2.p164==1))"))&&(F(!("...192
Formula 1 simplified : GF((!"((u2.p124==1)&&(u2.p164==1))" | GF!"((i7.u24.p211==1)&&(i7.u32.p228==1))") R ("((u2.p147==1)&&(u2.p164==1))" | G"((u2.p137==1)...173
Computing Next relation with stutter on 3.63306e+06 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.016: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.016: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.022: Initializing POR dependencies: labels 221, guards 216
pins2lts-mc-linux64( 6/ 8), 0.012: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.389: LTL layer: formula: <>([](!(LTLAPp0==true)))
pins2lts-mc-linux64( 3/ 8), 0.389: "<>([](!(LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.390: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.461: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.476: There are 222 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.476: State length is 273, there are 220 groups
pins2lts-mc-linux64( 0/ 8), 0.476: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.476: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.476: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.476: Visible groups: 0 / 220, labels: 1 / 222
pins2lts-mc-linux64( 0/ 8), 0.476: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.476: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.506: [Blue] ~45 levels ~960 states ~1960 transitions
pins2lts-mc-linux64( 0/ 8), 0.527: [Blue] ~45 levels ~1920 states ~3632 transitions
pins2lts-mc-linux64( 0/ 8), 0.553: [Blue] ~52 levels ~3840 states ~7544 transitions
pins2lts-mc-linux64( 0/ 8), 0.590: [Blue] ~201 levels ~7680 states ~14656 transitions
pins2lts-mc-linux64( 1/ 8), 0.744: [Blue] ~1140 levels ~15360 states ~21744 transitions
pins2lts-mc-linux64( 0/ 8), 0.960: [Blue] ~253 levels ~30720 states ~54272 transitions
pins2lts-mc-linux64( 1/ 8), 1.337: [Blue] ~2180 levels ~61440 states ~80744 transitions
pins2lts-mc-linux64( 1/ 8), 1.989: [Blue] ~2572 levels ~122880 states ~153096 transitions
pins2lts-mc-linux64( 1/ 8), 2.994: [Blue] ~3386 levels ~245760 states ~298880 transitions
pins2lts-mc-linux64( 1/ 8), 5.229: [Blue] ~3489 levels ~491520 states ~611056 transitions
pins2lts-mc-linux64( 1/ 8), 8.585: [Blue] ~3489 levels ~983040 states ~1210792 transitions
pins2lts-mc-linux64( 1/ 8), 14.769: [Blue] ~3566 levels ~1966080 states ~2482520 transitions
pins2lts-mc-linux64( 5/ 8), 28.100: [Blue] ~499 levels ~3932160 states ~5973104 transitions
pins2lts-mc-linux64( 1/ 8), 53.898: [Blue] ~4919 levels ~7864320 states ~10330120 transitions
pins2lts-mc-linux64( 5/ 8), 104.981: [Blue] ~1038 levels ~15728640 states ~23804832 transitions
pins2lts-mc-linux64( 5/ 8), 207.908: [Blue] ~1813 levels ~31457280 states ~47771048 transitions
pins2lts-mc-linux64( 5/ 8), 412.657: [Blue] ~3869 levels ~62914560 states ~95612512 transitions
pins2lts-mc-linux64( 5/ 8), 916.777: [Blue] ~28070 levels ~125829120 states ~169750088 transitions
pins2lts-mc-linux64( 7/ 8), 1077.512: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1077.546:
pins2lts-mc-linux64( 0/ 8), 1077.547: Explored 135073971 states 169670591 transitions, fanout: 1.256
pins2lts-mc-linux64( 0/ 8), 1077.547: Total exploration time 1077.050 sec (1077.010 sec minimum, 1077.034 sec on average)
pins2lts-mc-linux64( 0/ 8), 1077.547: States per second: 125411, Transitions per second: 157533
pins2lts-mc-linux64( 0/ 8), 1077.547:
pins2lts-mc-linux64( 0/ 8), 1077.547: State space has 134217308 states, 2881985 are accepting
pins2lts-mc-linux64( 0/ 8), 1077.547: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1077.547: blue states: 135073971 (100.64%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1077.547: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1077.547: all-red states: 3535994 (2.63%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1077.547:
pins2lts-mc-linux64( 0/ 8), 1077.547: Total memory used for local state coloring: 3.5MB
pins2lts-mc-linux64( 0/ 8), 1077.547:
pins2lts-mc-linux64( 0/ 8), 1077.547: Queue width: 8B, total height: 227869, memory: 1.74MB
pins2lts-mc-linux64( 0/ 8), 1077.547: Tree memory: 1229.2MB, 9.6 B/state, compr.: 0.9%
pins2lts-mc-linux64( 0/ 8), 1077.547: Tree fill ratio (roots/leafs): 99.0%/80.0%
pins2lts-mc-linux64( 0/ 8), 1077.547: Stored 216 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1077.547: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1077.547: Est. total memory use: 1230.9MB (~1025.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17701718549600138018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17701718549600138018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](!(LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 01:01:51] [INFO ] Applying decomposition
[2024-05-22 01:01:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:01:51] [INFO ] Decomposing Gal with order
[2024-05-22 01:01:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:01:51] [INFO ] Removed a total of 291 redundant transitions.
[2024-05-22 01:01:51] [INFO ] Flatten gal took : 22 ms
[2024-05-22 01:01:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 163 labels/synchronizations in 5 ms.
[2024-05-22 01:01:51] [INFO ] Time to serialize gal into /tmp/LTLFireability13575659679390119419.gal : 3 ms
[2024-05-22 01:01:51] [INFO ] Time to serialize properties into /tmp/LTLFireability13579278918901897629.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13575659679390119419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13579278918901897629.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G((("((u4.p124==1)&&(u7.p164==1))")&&(F(G("((u30.p211==1)&&(u38.p228==1))"))))U((!("((u4.p147==1)&&(u7.p164==1))"))&&(F(!("((u4.p...186
Formula 0 simplified : GF((!"((u4.p124==1)&&(u7.p164==1))" | GF!"((u30.p211==1)&&(u38.p228==1))") R ("((u4.p147==1)&&(u7.p164==1))" | G"((u4.p137==1)&&(u7....167
Detected timeout of ITS tools.
[2024-05-22 01:23:14] [INFO ] Flatten gal took : 10 ms
[2024-05-22 01:23:14] [INFO ] Input system was already deterministic with 216 transitions.
[2024-05-22 01:23:14] [INFO ] Transformed 272 places.
[2024-05-22 01:23:14] [INFO ] Transformed 216 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:23:14] [INFO ] Time to serialize gal into /tmp/LTLFireability1103350550691656260.gal : 17 ms
[2024-05-22 01:23:14] [INFO ] Time to serialize properties into /tmp/LTLFireability6651103504372773093.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1103350550691656260.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6651103504372773093.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G((("((p124==1)&&(p164==1))")&&(F(G("((p211==1)&&(p228==1))"))))U((!("((p147==1)&&(p164==1))"))&&(F(!("((p137==1)&&(p164==1))")))...160
Formula 0 simplified : GF((!"((p124==1)&&(p164==1))" | GF!"((p211==1)&&(p228==1))") R ("((p147==1)&&(p164==1))" | G"((p137==1)&&(p164==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11105752 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16041388 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-40a, 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 r109-tall-171624208600448"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 ;