Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r517-tall-167987243800356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is Murphy-PT-D3N050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243800356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 7 12:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 7 12:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 7 12:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 12:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 7 12:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 7 12:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 15K Mar 31 16:48 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 Murphy-PT-D3N050-LTLFireability-00
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-01
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-02
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-03
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-04
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-05
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-06
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-07
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-08
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-09
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-10
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-11
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-12
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-13
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-14
FORMULA_NAME Murphy-PT-D3N050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680937712380

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-08 07:08:34] [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]
[2023-04-08 07:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-08 07:08:34] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-04-08 07:08:34] [INFO ] Transformed 24 places.
[2023-04-08 07:08:34] [INFO ] Transformed 28 transitions.
[2023-04-08 07:08:34] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Murphy-PT-D3N050-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-PT-D3N050-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 10 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:08:34] [INFO ] Computed 5 invariants in 7 ms
[2023-04-08 07:08:34] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
[2023-04-08 07:08:34] [INFO ] Invariant cache hit.
[2023-04-08 07:08:34] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:08:34] [INFO ] Invariant cache hit.
[2023-04-08 07:08:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:34] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-04-08 07:08:34] [INFO ] Invariant cache hit.
[2023-04-08 07:08:35] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 24/24 places, 28/28 transitions.
Support contains 20 out of 24 places after structural reductions.
[2023-04-08 07:08:35] [INFO ] Flatten gal took : 17 ms
[2023-04-08 07:08:35] [INFO ] Flatten gal took : 6 ms
[2023-04-08 07:08:35] [INFO ] Input system was already deterministic with 28 transitions.
Support contains 19 out of 24 places (down from 20) after GAL structural reductions.
Incomplete random walk after 10040 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 19) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:08:35] [INFO ] Invariant cache hit.
[2023-04-08 07:08:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:35] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-04-08 07:08:35] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:08:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-04-08 07:08:35] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:35] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:35] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:35] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-04-08 07:08:35] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:35] [INFO ] Invariant cache hit.
[2023-04-08 07:08:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 24/24 places, 28/28 transitions.
Incomplete random walk after 10016 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 913191 steps, run timeout after 3001 ms. (steps per millisecond=304 ) properties seen :{}
Probabilistic random walk after 913191 steps, saw 621610 distinct states, run finished after 3002 ms. (steps per millisecond=304 ) properties seen :0
Running SMT prover for 3 properties.
[2023-04-08 07:08:38] [INFO ] Invariant cache hit.
[2023-04-08 07:08:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-08 07:08:38] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:38] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:08:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:38] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-04-08 07:08:38] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:38] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:38] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:38] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-04-08 07:08:38] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:38] [INFO ] Invariant cache hit.
[2023-04-08 07:08:39] [INFO ] Implicit Places using invariants in 68 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 71 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 74 ms. Remains : 20/24 places, 28/28 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=417 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 931715 steps, run timeout after 3001 ms. (steps per millisecond=310 ) properties seen :{}
Probabilistic random walk after 931715 steps, saw 633740 distinct states, run finished after 3001 ms. (steps per millisecond=310 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:08:42] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:08:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:42] [INFO ] After 12ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-04-08 07:08:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:42] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:08:42] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:08:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:42] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:42] [INFO ] After 8ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:42] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-04-08 07:08:42] [INFO ] After 64ms 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 3 ms.
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:42] [INFO ] Invariant cache hit.
[2023-04-08 07:08:42] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-04-08 07:08:42] [INFO ] Invariant cache hit.
[2023-04-08 07:08:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:42] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-04-08 07:08:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:08:42] [INFO ] Invariant cache hit.
[2023-04-08 07:08:42] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 14 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 14 /20 variables (removed 6) and now considering 20/28 (removed 8) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 20 rows 14 cols
[2023-04-08 07:08:42] [INFO ] Computed 1 invariants in 33 ms
[2023-04-08 07:08:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:42] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-04-08 07:08:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-04-08 07:08:42] [INFO ] After 5ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:08:42] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-08 07:08:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:42] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:42] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-04-08 07:08:42] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-04-08 07:08:42] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Computed a total of 0 stabilizing places and 0 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:08:42] [INFO ] Computed 5 invariants in 1 ms
[2023-04-08 07:08:42] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-04-08 07:08:42] [INFO ] Invariant cache hit.
[2023-04-08 07:08:42] [INFO ] Implicit Places using invariants in 30 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 31 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 79 ms. Remains : 20/24 places, 28/28 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 238 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s10 2) (GEQ s14 1)), p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 286 ms.
Stack based approach found an accepted trace after 120 steps with 0 reset with depth 121 and stack size 121 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-00 finished in 666 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&&X(F(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:43] [INFO ] Invariant cache hit.
[2023-04-08 07:08:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2023-04-08 07:08:43] [INFO ] Invariant cache hit.
[2023-04-08 07:08:43] [INFO ] Implicit Places using invariants in 25 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 65 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 3) (LT s8 1) (LT s14 1)), p1:(OR (AND (GEQ s9 1) (LT s9 1)) (LT s1 3) (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 13 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-PT-D3N050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-PT-D3N050-LTLFireability-01 finished in 509 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(F(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:43] [INFO ] Invariant cache hit.
[2023-04-08 07:08:43] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2023-04-08 07:08:43] [INFO ] Invariant cache hit.
[2023-04-08 07:08:43] [INFO ] Implicit Places using invariants in 49 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s10 2) (GEQ s14 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][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 172 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-02 finished in 406 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' '!((p0 U (G(!p1)&&F(p2))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:44] [INFO ] Invariant cache hit.
[2023-04-08 07:08:44] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:08:44] [INFO ] Invariant cache hit.
[2023-04-08 07:08:44] [INFO ] Implicit Places using invariants in 24 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 25 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s7 1)), p0:(AND (GEQ s2 1) (GEQ s6 1)), p2:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1400 steps with 1 reset in 20 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-06 finished in 254 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((p0 U (G(p0)&&F(p1)))))) U p2))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:44] [INFO ] Invariant cache hit.
[2023-04-08 07:08:44] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2023-04-08 07:08:44] [INFO ] Invariant cache hit.
[2023-04-08 07:08:44] [INFO ] Implicit Places using invariants in 25 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 26 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (OR (NOT p2) (AND p0 p1)), (AND p0 p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s13 1) (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)), p0:(GEQ s9 1), p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3637 reset in 169 ms.
Stack based approach found an accepted trace after 213 steps with 5 reset with depth 20 and stack size 20 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-07 finished in 348 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(G(p0)))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:44] [INFO ] Invariant cache hit.
[2023-04-08 07:08:44] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2023-04-08 07:08:44] [INFO ] Invariant cache hit.
[2023-04-08 07:08:44] [INFO ] Implicit Places using invariants in 32 ms returned [8, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 77 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s1 3) (LT s8 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-08 finished in 163 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 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:45] [INFO ] Invariant cache hit.
[2023-04-08 07:08:45] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2023-04-08 07:08:45] [INFO ] Invariant cache hit.
[2023-04-08 07:08:45] [INFO ] Implicit Places using invariants in 25 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 26 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-09 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 (GEQ s11 2) (GEQ s15 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 0 reset in 161 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-09 finished in 265 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((G(!p1)||p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:45] [INFO ] Invariant cache hit.
[2023-04-08 07:08:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:08:45] [INFO ] Invariant cache hit.
[2023-04-08 07:08:45] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 2) (GEQ s15 1)), p0:(OR (LT s0 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 170 ms.
Product exploration explored 100000 steps with 0 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 163 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 80 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:08:46] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:08:46] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-04-08 07:08:46] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:46] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:46] [INFO ] After 2ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:46] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:08:46] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:46] [INFO ] Invariant cache hit.
[2023-04-08 07:08:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2235231 steps, run timeout after 3001 ms. (steps per millisecond=744 ) properties seen :{}
Probabilistic random walk after 2235231 steps, saw 1521064 distinct states, run finished after 3001 ms. (steps per millisecond=744 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:49] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:49] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:49] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:49] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:08:49] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-04-08 07:08:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:08:49] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:08:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:49] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:49] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:08:49] [INFO ] After 4ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:49] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:08:49] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 190 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 :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:08:49] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:08:49] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:49] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-04-08 07:08:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:08:49] [INFO ] Invariant cache hit.
[2023-04-08 07:08:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 20/20 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 172 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 71 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10012 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=834 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:08:50] [INFO ] Invariant cache hit.
[2023-04-08 07:08:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:50] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:50] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:50] [INFO ] After 2ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:08:50] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:50] [INFO ] Invariant cache hit.
[2023-04-08 07:08:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2250730 steps, run timeout after 3001 ms. (steps per millisecond=749 ) properties seen :{}
Probabilistic random walk after 2250730 steps, saw 1531410 distinct states, run finished after 3001 ms. (steps per millisecond=749 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:08:53] [INFO ] Invariant cache hit.
[2023-04-08 07:08:53] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:53] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:08:53] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:53] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:53] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:08:53] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:08:53] [INFO ] Invariant cache hit.
[2023-04-08 07:08:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-08 07:08:53] [INFO ] Invariant cache hit.
[2023-04-08 07:08:53] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:08:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-08 07:08:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:08:53] [INFO ] Invariant cache hit.
[2023-04-08 07:08:53] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 2 ms. Remains 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:08:53] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:08:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:53] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:08:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:08:53] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:53] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:08:53] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:08:53] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:08:53] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 231 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 77 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 187 ms.
Product exploration explored 100000 steps with 0 reset in 230 ms.
Built C files in :
/tmp/ltsmin11127929257908794355
[2023-04-08 07:08:54] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2023-04-08 07:08:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:54] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2023-04-08 07:08:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:54] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2023-04-08 07:08:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:08:54] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11127929257908794355
Running compilation step : cd /tmp/ltsmin11127929257908794355;'/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 218 ms.
Running link step : cd /tmp/ltsmin11127929257908794355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin11127929257908794355;'/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/stateBased14614907406958965377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:09:09] [INFO ] Computed 1 invariants in 2 ms
[2023-04-08 07:09:09] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
[2023-04-08 07:09:09] [INFO ] Invariant cache hit.
[2023-04-08 07:09:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-08 07:09:09] [INFO ] Invariant cache hit.
[2023-04-08 07:09:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:09:09] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-08 07:09:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:09:09] [INFO ] Invariant cache hit.
[2023-04-08 07:09:10] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 157 ms. Remains : 20/20 places, 28/28 transitions.
Built C files in :
/tmp/ltsmin12522335429020002021
[2023-04-08 07:09:10] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2023-04-08 07:09:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:09:10] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2023-04-08 07:09:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:09:10] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2023-04-08 07:09:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:09:10] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12522335429020002021
Running compilation step : cd /tmp/ltsmin12522335429020002021;'/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 87 ms.
Running link step : cd /tmp/ltsmin12522335429020002021;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12522335429020002021;'/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/stateBased2559259613549915675.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-08 07:09:25] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:09:25] [INFO ] Flatten gal took : 5 ms
[2023-04-08 07:09:25] [INFO ] Time to serialize gal into /tmp/LTL7948371814253476212.gal : 1 ms
[2023-04-08 07:09:25] [INFO ] Time to serialize properties into /tmp/LTL14684436131601564294.prop : 10 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/LTL7948371814253476212.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12251287475757230451.hoa' '-atoms' '/tmp/LTL14684436131601564294.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/LTL14684436131601564294.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12251287475757230451.hoa
Detected timeout of ITS tools.
[2023-04-08 07:09:40] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:09:40] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:09:40] [INFO ] Time to serialize gal into /tmp/LTL15161981886529562571.gal : 0 ms
[2023-04-08 07:09:40] [INFO ] Time to serialize properties into /tmp/LTL6804594009875253307.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/LTL15161981886529562571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6804594009875253307.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 : !((G(F(("((p0_1<1)||(p1_1<1))")||(G("((p3_4<2)||(p4_4<1))"))))))
Formula 0 simplified : G(F!"((p3_4<2)||(p4_4<1))" & FG!"((p0_1<1)||(p1_1<1))")
Detected timeout of ITS tools.
[2023-04-08 07:09:55] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:09:55] [INFO ] Applying decomposition
[2023-04-08 07:09:55] [INFO ] Flatten gal took : 2 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/graph13631529851545178489.txt' '-o' '/tmp/graph13631529851545178489.bin' '-w' '/tmp/graph13631529851545178489.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13631529851545178489.bin' '-l' '-1' '-v' '-w' '/tmp/graph13631529851545178489.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:09:55] [INFO ] Decomposing Gal with order
[2023-04-08 07:09:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:09:55] [INFO ] Flatten gal took : 27 ms
[2023-04-08 07:09:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-08 07:09:55] [INFO ] Time to serialize gal into /tmp/LTL1572584908258191461.gal : 2 ms
[2023-04-08 07:09:55] [INFO ] Time to serialize properties into /tmp/LTL13295792840554893285.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/LTL1572584908258191461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13295792840554893285.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...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i0.i1.u0.p0_1<1)||(i0.i1.u0.p1_1<1))")||(G("((u7.p3_4<2)||(u7.p4_4<1))"))))))
Formula 0 simplified : G(F!"((u7.p3_4<2)||(u7.p4_4<1))" & FG!"((i0.i1.u0.p0_1<1)||(i0.i1.u0.p1_1<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17110402962918856754
[2023-04-08 07:10:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17110402962918856754
Running compilation step : cd /tmp/ltsmin17110402962918856754;'/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 124 ms.
Running link step : cd /tmp/ltsmin17110402962918856754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17110402962918856754;'/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))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Murphy-PT-D3N050-LTLFireability-10 finished in 100210 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(p0))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:10:25] [INFO ] Computed 5 invariants in 2 ms
[2023-04-08 07:10:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2023-04-08 07:10:25] [INFO ] Invariant cache hit.
[2023-04-08 07:10:25] [INFO ] Implicit Places using invariants in 23 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 24 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s4 1) (LT s10 2) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 182 ms.
Product exploration explored 100000 steps with 0 reset in 200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Incomplete random walk after 10006 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2213870 steps, run timeout after 3001 ms. (steps per millisecond=737 ) properties seen :{}
Probabilistic random walk after 2213870 steps, saw 1505846 distinct states, run finished after 3001 ms. (steps per millisecond=737 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:10:29] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:10:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:10:29] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:10:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:10:29] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:29] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:29] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:10:29] [INFO ] After 43ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:10:29] [INFO ] Invariant cache hit.
[2023-04-08 07:10:29] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10037 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1115 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2244179 steps, run timeout after 3001 ms. (steps per millisecond=747 ) properties seen :{}
Probabilistic random walk after 2244179 steps, saw 1527069 distinct states, run finished after 3002 ms. (steps per millisecond=747 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:10:32] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:10:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:10:32] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:32] [INFO ] After 3ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:32] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:10:32] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:32] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-04-08 07:10:32] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:10:32] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:10:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2023-04-08 07:10:32] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:10:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:10:32] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:10:32] [INFO ] After 6ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:32] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:10:32] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[true, (NOT p0)]
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:10:32] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:10:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:32] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-04-08 07:10:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:10:32] [INFO ] Invariant cache hit.
[2023-04-08 07:10:32] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 20/20 places, 28/28 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2162429 steps, run timeout after 3001 ms. (steps per millisecond=720 ) properties seen :{}
Probabilistic random walk after 2162429 steps, saw 1471786 distinct states, run finished after 3001 ms. (steps per millisecond=720 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:10:36] [INFO ] Invariant cache hit.
[2023-04-08 07:10:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:10:36] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:10:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:10:36] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:36] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:36] [INFO ] After 2ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:36] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-04-08 07:10:36] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:10:36] [INFO ] Invariant cache hit.
[2023-04-08 07:10:36] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 20/20 places, 28/28 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2129292 steps, run timeout after 3001 ms. (steps per millisecond=709 ) properties seen :{}
Probabilistic random walk after 2129292 steps, saw 1449175 distinct states, run finished after 3002 ms. (steps per millisecond=709 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-08 07:10:39] [INFO ] Invariant cache hit.
[2023-04-08 07:10:39] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:10:39] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:10:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-08 07:10:39] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:39] [INFO ] After 4ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:39] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:10:39] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:10:39] [INFO ] Invariant cache hit.
[2023-04-08 07:10:39] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-04-08 07:10:39] [INFO ] Invariant cache hit.
[2023-04-08 07:10:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-04-08 07:10:39] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:10:39] [INFO ] Invariant cache hit.
[2023-04-08 07:10:39] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 20/20 places, 28/28 transitions.
Graph (complete) has 48 edges and 20 vertex of which 11 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Applied a total of 1 rules in 1 ms. Remains 11 /20 variables (removed 9) and now considering 16/28 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 11 cols
[2023-04-08 07:10:39] [INFO ] Computed 1 invariants in 1 ms
[2023-04-08 07:10:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:10:39] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-08 07:10:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-08 07:10:39] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-04-08 07:10:39] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-08 07:10:39] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-08 07:10:39] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 66 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 186 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Built C files in :
/tmp/ltsmin8904640510491873883
[2023-04-08 07:10:40] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2023-04-08 07:10:40] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:10:40] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2023-04-08 07:10:40] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:10:40] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2023-04-08 07:10:40] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:10:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8904640510491873883
Running compilation step : cd /tmp/ltsmin8904640510491873883;'/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 93 ms.
Running link step : cd /tmp/ltsmin8904640510491873883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8904640510491873883;'/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/stateBased7075985317574806339.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 20 cols
[2023-04-08 07:10:55] [INFO ] Computed 1 invariants in 0 ms
[2023-04-08 07:10:55] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
[2023-04-08 07:10:55] [INFO ] Invariant cache hit.
[2023-04-08 07:10:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-04-08 07:10:55] [INFO ] Invariant cache hit.
[2023-04-08 07:10:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-04-08 07:10:55] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-04-08 07:10:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-08 07:10:55] [INFO ] Invariant cache hit.
[2023-04-08 07:10:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 123 ms. Remains : 20/20 places, 28/28 transitions.
Built C files in :
/tmp/ltsmin3276064894887951524
[2023-04-08 07:10:55] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2023-04-08 07:10:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:10:55] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2023-04-08 07:10:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:10:55] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2023-04-08 07:10:55] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:10:55] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3276064894887951524
Running compilation step : cd /tmp/ltsmin3276064894887951524;'/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 98 ms.
Running link step : cd /tmp/ltsmin3276064894887951524;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin3276064894887951524;'/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/stateBased6821440472715846881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-08 07:11:10] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:11:10] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:11:10] [INFO ] Time to serialize gal into /tmp/LTL10845431752458704648.gal : 1 ms
[2023-04-08 07:11:10] [INFO ] Time to serialize properties into /tmp/LTL8337025578901121150.prop : 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/LTL10845431752458704648.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2569506406827374024.hoa' '-atoms' '/tmp/LTL8337025578901121150.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...318
Loading property file /tmp/LTL8337025578901121150.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2569506406827374024.hoa
Detected timeout of ITS tools.
[2023-04-08 07:11:25] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:11:25] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:11:25] [INFO ] Time to serialize gal into /tmp/LTL17238549161875557874.gal : 3 ms
[2023-04-08 07:11:25] [INFO ] Time to serialize properties into /tmp/LTL1244174806132685644.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/LTL17238549161875557874.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1244174806132685644.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 : !((G("(((p0_1<1)||(p1_1<1))||((p3_3<2)||(p4_3<1)))")))
Formula 0 simplified : F!"(((p0_1<1)||(p1_1<1))||((p3_3<2)||(p4_3<1)))"
Detected timeout of ITS tools.
[2023-04-08 07:11:40] [INFO ] Flatten gal took : 5 ms
[2023-04-08 07:11:40] [INFO ] Applying decomposition
[2023-04-08 07:11:40] [INFO ] Flatten gal took : 2 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/graph4070443963267846286.txt' '-o' '/tmp/graph4070443963267846286.bin' '-w' '/tmp/graph4070443963267846286.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4070443963267846286.bin' '-l' '-1' '-v' '-w' '/tmp/graph4070443963267846286.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:11:40] [INFO ] Decomposing Gal with order
[2023-04-08 07:11:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:11:40] [INFO ] Flatten gal took : 2 ms
[2023-04-08 07:11:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-08 07:11:40] [INFO ] Time to serialize gal into /tmp/LTL13750579423335926359.gal : 1 ms
[2023-04-08 07:11:40] [INFO ] Time to serialize properties into /tmp/LTL6877048237818984935.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/LTL13750579423335926359.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6877048237818984935.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...255
Read 1 LTL properties
Checking formula 0 : !((G("(((i0.i1.u2.p0_1<1)||(i0.i1.u2.p1_1<1))||((u7.p3_3<2)||(u7.p4_3<1)))")))
Formula 0 simplified : F!"(((i0.i1.u2.p0_1<1)||(i0.i1.u2.p1_1<1))||((u7.p3_3<2)||(u7.p4_3<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16585292719577410261
[2023-04-08 07:11:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16585292719577410261
Running compilation step : cd /tmp/ltsmin16585292719577410261;'/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 88 ms.
Running link step : cd /tmp/ltsmin16585292719577410261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin16585292719577410261;'/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 Murphy-PT-D3N050-LTLFireability-11 finished in 105259 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)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
// Phase 1: matrix 28 rows 24 cols
[2023-04-08 07:12:10] [INFO ] Computed 5 invariants in 4 ms
[2023-04-08 07:12:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2023-04-08 07:12:10] [INFO ] Invariant cache hit.
[2023-04-08 07:12:10] [INFO ] Implicit Places using invariants in 32 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 20/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, p0]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s13 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 7923 reset in 144 ms.
Stack based approach found an accepted trace after 601 steps with 51 reset with depth 5 and stack size 5 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-12 finished in 322 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(p1)&&p0) U (p2||X(p3))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:12:11] [INFO ] Invariant cache hit.
[2023-04-08 07:12:11] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-04-08 07:12:11] [INFO ] Invariant cache hit.
[2023-04-08 07:12:11] [INFO ] Implicit Places using invariants in 26 ms returned [8, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 75 ms. Remains : 22/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (NOT p1)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=2 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(GEQ s10 1), p0:(AND (GEQ s2 3) (GEQ s8 1) (GEQ s16 1)), p1:(AND (GEQ s3 1) (GEQ s7 1) (GEQ s9 1)), p3:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-13 finished in 292 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(G((F(p0)||X(p1)))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:12:11] [INFO ] Invariant cache hit.
[2023-04-08 07:12:11] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2023-04-08 07:12:11] [INFO ] Invariant cache hit.
[2023-04-08 07:12:11] [INFO ] Implicit Places using invariants in 24 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s4 1)), p1:(AND (GEQ s0 3) (GEQ s8 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 159 reset in 160 ms.
Stack based approach found an accepted trace after 68 steps with 0 reset with depth 69 and stack size 69 in 0 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-14 finished in 397 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' '!(((p0 U p1)&&G(F(p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2023-04-08 07:12:11] [INFO ] Invariant cache hit.
[2023-04-08 07:12:11] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2023-04-08 07:12:11] [INFO ] Invariant cache hit.
[2023-04-08 07:12:11] [INFO ] Implicit Places using invariants in 24 ms returned [9, 10, 11]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 21/24 places, 28/28 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-PT-D3N050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s8 1)), p0:(GEQ s10 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, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6345 reset in 155 ms.
Stack based approach found an accepted trace after 34 steps with 3 reset with depth 12 and stack size 12 in 1 ms.
FORMULA Murphy-PT-D3N050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-PT-D3N050-LTLFireability-15 finished in 421 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((G(!p1)||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' '!(G(p0))'
[2023-04-08 07:12:12] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4268056999085376119
[2023-04-08 07:12:12] [INFO ] Computing symmetric may disable matrix : 28 transitions.
[2023-04-08 07:12:12] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:12:12] [INFO ] Computing symmetric may enable matrix : 28 transitions.
[2023-04-08 07:12:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:12:12] [INFO ] Computing Do-Not-Accords matrix : 28 transitions.
[2023-04-08 07:12:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-08 07:12:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4268056999085376119
Running compilation step : cd /tmp/ltsmin4268056999085376119;'/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'
[2023-04-08 07:12:12] [INFO ] Applying decomposition
[2023-04-08 07:12:12] [INFO ] Flatten gal took : 2 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/graph7110911307408233404.txt' '-o' '/tmp/graph7110911307408233404.bin' '-w' '/tmp/graph7110911307408233404.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7110911307408233404.bin' '-l' '-1' '-v' '-w' '/tmp/graph7110911307408233404.weights' '-q' '0' '-e' '0.001'
[2023-04-08 07:12:12] [INFO ] Decomposing Gal with order
[2023-04-08 07:12:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-08 07:12:12] [INFO ] Flatten gal took : 3 ms
[2023-04-08 07:12:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-04-08 07:12:12] [INFO ] Time to serialize gal into /tmp/LTLFireability12656367077688118027.gal : 1 ms
[2023-04-08 07:12:12] [INFO ] Time to serialize properties into /tmp/LTLFireability7610824470004883623.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/LTLFireability12656367077688118027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7610824470004883623.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 : !((G(F(("((i1.u2.p0_1<1)||(i1.u2.p1_1<1))")||(G(!("((u7.p3_4>=2)&&(u7.p4_4>=1))")))))))
Formula 0 simplified : G(F"((u7.p3_4>=2)&&(u7.p4_4>=1))" & FG!"((i1.u2.p0_1<1)||(i1.u2.p1_1<1))")
Compilation finished in 168 ms.
Running link step : cd /tmp/ltsmin4268056999085376119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4268056999085376119;'/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' '[](<>(([](!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: Initializing POR dependencies: labels 31, guards 28
pins2lts-mc-linux64( 3/ 8), 0.002: LTL layer: formula: [](<>(([](!(LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.003: "[](<>(([](!(LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.019: There are 32 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.019: State length is 25, there are 34 groups
pins2lts-mc-linux64( 0/ 8), 0.019: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.019: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.019: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.019: Visible groups: 0 / 34, labels: 2 / 32
pins2lts-mc-linux64( 0/ 8), 0.019: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.019: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.087: [Blue] ~120 levels ~960 states ~3464 transitions
pins2lts-mc-linux64( 5/ 8), 0.118: [Blue] ~240 levels ~1920 states ~6360 transitions
pins2lts-mc-linux64( 5/ 8), 0.182: [Blue] ~480 levels ~3840 states ~12120 transitions
pins2lts-mc-linux64( 7/ 8), 0.277: [Blue] ~960 levels ~7680 states ~29144 transitions
pins2lts-mc-linux64( 5/ 8), 0.400: [Blue] ~1916 levels ~15360 states ~54752 transitions
pins2lts-mc-linux64( 1/ 8), 0.659: [Blue] ~3824 levels ~30720 states ~109200 transitions
pins2lts-mc-linux64( 5/ 8), 0.941: [Blue] ~7671 levels ~61440 states ~210912 transitions
pins2lts-mc-linux64( 1/ 8), 1.375: [Blue] ~15272 levels ~122880 states ~416168 transitions
pins2lts-mc-linux64( 5/ 8), 1.962: [Blue] ~30699 levels ~245760 states ~885800 transitions
pins2lts-mc-linux64( 5/ 8), 2.658: [Blue] ~61416 levels ~491520 states ~1747584 transitions
pins2lts-mc-linux64( 7/ 8), 3.572: [Blue] ~122880 levels ~983040 states ~4126720 transitions
pins2lts-mc-linux64( 7/ 8), 5.863: [Blue] ~245760 levels ~1966080 states ~8398440 transitions
pins2lts-mc-linux64( 7/ 8), 10.388: [Blue] ~491520 levels ~3932160 states ~16905120 transitions
pins2lts-mc-linux64( 7/ 8), 19.926: [Blue] ~983040 levels ~7864320 states ~34206104 transitions
pins2lts-mc-linux64( 4/ 8), 41.739: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 41.822:
pins2lts-mc-linux64( 0/ 8), 41.822: Explored 10601021 states 59365431 transitions, fanout: 5.600
pins2lts-mc-linux64( 0/ 8), 41.822: Total exploration time 41.780 sec (41.710 sec minimum, 41.731 sec on average)
pins2lts-mc-linux64( 0/ 8), 41.822: States per second: 253734, Transitions per second: 1420906
pins2lts-mc-linux64( 0/ 8), 41.822:
pins2lts-mc-linux64( 0/ 8), 41.822: State space has 31207812 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 41.822: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 41.822: blue states: 10601021 (33.97%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 41.822: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 41.822: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 41.822:
pins2lts-mc-linux64( 0/ 8), 41.822: Total memory used for local state coloring: 161.6MB
pins2lts-mc-linux64( 0/ 8), 41.822:
pins2lts-mc-linux64( 0/ 8), 41.822: Queue width: 8B, total height: 10593808, memory: 80.82MB
pins2lts-mc-linux64( 0/ 8), 41.822: Tree memory: 494.1MB, 16.6 B/state, compr.: 16.3%
pins2lts-mc-linux64( 0/ 8), 41.822: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 41.822: Stored 28 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 41.822: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 41.822: Est. total memory use: 574.9MB (~1104.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4268056999085376119;'/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' '[](<>(([](!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin4268056999085376119;'/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' '[](<>(([](!(LTLAPp1==true))||(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.
[2023-04-08 07:33:24] [INFO ] Flatten gal took : 4 ms
[2023-04-08 07:33:24] [INFO ] Time to serialize gal into /tmp/LTLFireability13262089308132317156.gal : 1 ms
[2023-04-08 07:33:24] [INFO ] Time to serialize properties into /tmp/LTLFireability6016055141421833894.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/LTLFireability13262089308132317156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6016055141421833894.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...298
Read 2 LTL properties
Checking formula 0 : !((G(F(("((p0_1<1)||(p1_1<1))")||(G(!("((p3_4>=2)&&(p4_4>=1))")))))))
Formula 0 simplified : G(F"((p3_4>=2)&&(p4_4>=1))" & FG!"((p0_1<1)||(p1_1<1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
20908 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,209.088,1688064,1,0,57,6.33763e+06,80,27,3315,6.6367e+06,68
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Murphy-PT-D3N050-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("(((p0_1<1)||(p1_1<1))||((p3_3<2)||(p4_3<1)))")))
Formula 1 simplified : F!"(((p0_1<1)||(p1_1<1))||((p3_3<2)||(p4_3<1)))"
Detected timeout of ITS tools.
[2023-04-08 07:54:36] [INFO ] Flatten gal took : 5 ms
[2023-04-08 07:54:36] [INFO ] Input system was already deterministic with 28 transitions.
[2023-04-08 07:54:36] [INFO ] Transformed 24 places.
[2023-04-08 07:54:36] [INFO ] Transformed 28 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
[2023-04-08 07:54:36] [INFO ] Time to serialize gal into /tmp/LTLFireability7937166842459771419.gal : 0 ms
[2023-04-08 07:54:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16375661002175213217.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/LTLFireability7937166842459771419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16375661002175213217.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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G("(((p0_1<1)||(p1_1<1))||((p3_3<2)||(p4_3<1)))")))
Formula 0 simplified : F!"(((p0_1<1)||(p1_1<1))||((p3_3<2)||(p4_3<1)))"
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, Intersection with reachable at each step enabled. (destroyed/reverse/interse...175
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 8831920 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039396 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="Murphy-PT-D3N050"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Murphy-PT-D3N050, 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 r517-tall-167987243800356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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