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.r103-tall-167814478300412.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 lolaxred
Input is DES-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 43K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678251119946

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:52:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 04:52:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:52:01] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2023-03-08 04:52:01] [INFO ] Transformed 155 places.
[2023-03-08 04:52:01] [INFO ] Transformed 112 transitions.
[2023-03-08 04:52:01] [INFO ] Found NUPN structural information;
[2023-03-08 04:52:01] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 101 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 97
Applied a total of 2 rules in 20 ms. Remains 154 /155 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 154 cols
[2023-03-08 04:52:01] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-08 04:52:02] [INFO ] Implicit Places using invariants in 442 ms returned []
[2023-03-08 04:52:02] [INFO ] Invariant cache hit.
[2023-03-08 04:52:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 04:52:02] [INFO ] Implicit Places using invariants and state equation in 158 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 623 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 153/155 places, 97/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 648 ms. Remains : 153/155 places, 97/98 transitions.
Support contains 54 out of 153 places after structural reductions.
[2023-03-08 04:52:02] [INFO ] Flatten gal took : 33 ms
[2023-03-08 04:52:02] [INFO ] Flatten gal took : 14 ms
[2023-03-08 04:52:02] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 52 out of 153 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 226 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10000 steps, including 51 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:52:03] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 04:52:03] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:52:03] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:03] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 04:52:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 04:52:03] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 04:52:03] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 04:52:03] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 3 ms to minimize.
[2023-03-08 04:52:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 04:52:03] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-08 04:52:03] [INFO ] After 577ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 6 properties in 51 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 153 transition count 95
Applied a total of 7 rules in 31 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1829042 steps, run timeout after 3001 ms. (steps per millisecond=609 ) properties seen :{}
Probabilistic random walk after 1829042 steps, saw 255131 distinct states, run finished after 3002 ms. (steps per millisecond=609 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:52:07] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 04:52:07] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2023-03-08 04:52:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 04:52:07] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:52:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:52:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2023-03-08 04:52:07] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:07] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 04:52:07] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 04:52:07] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 04:52:07] [INFO ] Invariant cache hit.
[2023-03-08 04:52:07] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 04:52:07] [INFO ] Invariant cache hit.
[2023-03-08 04:52:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:07] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2023-03-08 04:52:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:07] [INFO ] Invariant cache hit.
[2023-03-08 04:52:07] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 339 ms. Remains : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 04:52:07] [INFO ] Invariant cache hit.
[2023-03-08 04:52:07] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 04:52:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 04:52:07] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:52:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 04:52:08] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:52:08] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 2 ms to minimize.
[2023-03-08 04:52:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-08 04:52:08] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 04:52:08] [INFO ] After 281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 56 stabilizing places and 51 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p1&&X(F(p0)))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:52:08] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:52:08] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:52:08] [INFO ] Invariant cache hit.
[2023-03-08 04:52:08] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 04:52:08] [INFO ] Invariant cache hit.
[2023-03-08 04:52:08] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 308 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) p1), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 2}, { cond=(NOT p1), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s42 1) (EQ s54 1)), p0:(AND (EQ s56 1) (EQ s57 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]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 2 ms.
FORMULA DES-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-00 finished in 666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:09] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s71 1) (EQ s134 1) (OR (EQ s107 0) (EQ s123 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 109 steps with 1 reset in 4 ms.
FORMULA DES-PT-10a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-01 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p0))||(!p1&&F(!p0)))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:09] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:09] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-08 04:52:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:09] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 82 ms :[p0, p0]
Running random walk in product with property : DES-PT-10a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s38 1) (EQ s45 1)), p0:(AND (NOT (AND (EQ s3 1) (EQ s72 1) (EQ s74 1) (EQ s71 1) (EQ s134 1))) (NOT (AND (EQ s2 1) (EQ s72 1) (EQ s74 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-03 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:09] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 314 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s46 0) (OR (EQ s27 0) (EQ s69 0)))], 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 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-04 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLFireability-05 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s112 1) (EQ s114 1) (EQ s116 1) (EQ s118 1) (EQ s120 1) (EQ s122 1) (EQ s124 1) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-05 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:10] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 04:52:10] [INFO ] Invariant cache hit.
[2023-03-08 04:52:11] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 04:52:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:11] [INFO ] Invariant cache hit.
[2023-03-08 04:52:11] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10a-LTLFireability-06 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:(OR (EQ s109 0) (EQ s125 0)), p1:(OR (NEQ s109 1) (NEQ s125 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 2365 reset in 270 ms.
Product exploration explored 100000 steps with 2331 reset in 262 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 183 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 45 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:12] [INFO ] Invariant cache hit.
[2023-03-08 04:52:12] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:52:12] [INFO ] Invariant cache hit.
[2023-03-08 04:52:12] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 04:52:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:12] [INFO ] Invariant cache hit.
[2023-03-08 04:52:12] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 195 steps, including 4 resets, run visited all 2 properties in 8 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2342 reset in 218 ms.
Product exploration explored 100000 steps with 2354 reset in 247 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:14] [INFO ] Invariant cache hit.
[2023-03-08 04:52:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:52:14] [INFO ] Invariant cache hit.
[2023-03-08 04:52:14] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-08 04:52:14] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:14] [INFO ] Invariant cache hit.
[2023-03-08 04:52:14] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-06 finished in 3630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:14] [INFO ] Invariant cache hit.
[2023-03-08 04:52:14] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 04:52:14] [INFO ] Invariant cache hit.
[2023-03-08 04:52:14] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-08 04:52:14] [INFO ] Invariant cache hit.
[2023-03-08 04:52:14] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s18 0) (EQ s148 0)), p1:(AND (EQ s53 1) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 225 ms.
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 120 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-08 finished in 1015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(F(p1)&&G(p2))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:15] [INFO ] Invariant cache hit.
[2023-03-08 04:52:15] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 04:52:15] [INFO ] Invariant cache hit.
[2023-03-08 04:52:15] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 04:52:15] [INFO ] Invariant cache hit.
[2023-03-08 04:52:15] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 291 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 0}, { cond=(AND p1 p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p0:(OR (EQ s24 0) (EQ s69 0)), p2:(AND (EQ s13 1) (EQ s148 1)), p1:(AND (EQ s11 1) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 13 factoid took 205 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-10 finished in 1288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G((X(p1) U (F(p3)&&p2))))))'
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:16] [INFO ] Invariant cache hit.
[2023-03-08 04:52:16] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 04:52:16] [INFO ] Invariant cache hit.
[2023-03-08 04:52:16] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-08 04:52:16] [INFO ] Invariant cache hit.
[2023-03-08 04:52:17] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-10a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s61 1) (EQ s66 1) (EQ s68 1)), p2:(AND (EQ s135 1) (EQ s149 1)), p3:(AND (EQ s135 1) (EQ s149 1)), p1:(AND (EQ s37 1) (EQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-11 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p1)||p0))))'
Support contains 4 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:17] [INFO ] Invariant cache hit.
[2023-03-08 04:52:17] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 04:52:17] [INFO ] Invariant cache hit.
[2023-03-08 04:52:17] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 04:52:17] [INFO ] Invariant cache hit.
[2023-03-08 04:52:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-10a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(OR (EQ s17 0) (EQ s148 0)), p0:(OR (EQ s95 0) (EQ s111 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Product exploration explored 100000 steps with 33333 reset in 262 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) p1))))
Knowledge based reduction with 4 factoid took 107 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLFireability-12 finished in 1037 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F(p1)))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:18] [INFO ] Invariant cache hit.
[2023-03-08 04:52:18] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 04:52:18] [INFO ] Invariant cache hit.
[2023-03-08 04:52:18] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-08 04:52:18] [INFO ] Invariant cache hit.
[2023-03-08 04:52:18] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 287 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-10a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s45 1)), p1:(AND (EQ s61 1) (EQ s66 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 109 steps with 2 reset in 1 ms.
FORMULA DES-PT-10a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLFireability-13 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1||F(((!p2&&F((!p2&&X(G(!p3)))))||G((F(!p2)&&F(G(!p3)))))))))))'
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:18] [INFO ] Invariant cache hit.
[2023-03-08 04:52:18] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 04:52:18] [INFO ] Invariant cache hit.
[2023-03-08 04:52:18] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 04:52:18] [INFO ] Invariant cache hit.
[2023-03-08 04:52:18] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 622 ms :[(OR (AND p1 p2) (AND p1 p3)), (OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND (NOT p1) p2 p3), (AND p1 p3), false, p2, (AND p1 p2), false, (AND p3 p1), false, (AND p2 p1), false]
Running random walk in product with property : DES-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 8}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 9}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={1} source=4 dest: 4}, { cond=p3, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p3 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 10}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 14}], [{ cond=p2, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=9 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 14}], [{ cond=p1, acceptance={} source=11 dest: 4}, { cond=(NOT p1), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=12 dest: 14}], [{ cond=(AND p1 p2), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s72 1) (EQ s74 1)), p1:(AND (EQ s4 1) (EQ s72 1) (EQ s74 1)), p2:(AND (EQ s142 1) (EQ s147 1)), p3:(AND (EQ s105 1) (EQ s121 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2246 reset in 211 ms.
Product exploration explored 100000 steps with 2215 reset in 263 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 1852 ms. Reduced automaton from 15 states, 53 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:52:22] [INFO ] Invariant cache hit.
[2023-03-08 04:52:22] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:22] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:22] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:22] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 117 ms returned sat
[2023-03-08 04:52:22] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:22] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 04:52:22] [INFO ] After 332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 12 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1318585 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :{}
Probabilistic random walk after 1318585 steps, saw 183995 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:25] [INFO ] Computed 60 place invariants in 9 ms
[2023-03-08 04:52:26] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:26] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 127 ms returned sat
[2023-03-08 04:52:26] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:26] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:26] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2023-03-08 04:52:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-08 04:52:26] [INFO ] After 110ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 04:52:26] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 49 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 04:52:26] [INFO ] Invariant cache hit.
[2023-03-08 04:52:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 04:52:26] [INFO ] Invariant cache hit.
[2023-03-08 04:52:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:26] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2023-03-08 04:52:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:26] [INFO ] Invariant cache hit.
[2023-03-08 04:52:26] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 309 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:26] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:52:26] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:26] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 128 ms returned sat
[2023-03-08 04:52:27] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:27] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2023-03-08 04:52:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-08 04:52:27] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 04:52:27] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 41 factoid took 1879 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 229 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:52:29] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-08 04:52:29] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 04:52:29] [INFO ] Invariant cache hit.
[2023-03-08 04:52:29] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 04:52:29] [INFO ] Invariant cache hit.
[2023-03-08 04:52:29] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 282 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 538 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:52:30] [INFO ] Invariant cache hit.
[2023-03-08 04:52:30] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:30] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 04:52:30] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:52:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 121 ms returned sat
[2023-03-08 04:52:31] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:31] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 04:52:31] [INFO ] After 331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 52 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 11 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1281012 steps, run timeout after 3001 ms. (steps per millisecond=426 ) properties seen :{}
Probabilistic random walk after 1281012 steps, saw 178530 distinct states, run finished after 3001 ms. (steps per millisecond=426 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:34] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 04:52:34] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 04:52:34] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 04:52:34] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 127 ms returned sat
[2023-03-08 04:52:34] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:34] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:34] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2023-03-08 04:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 04:52:35] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 04:52:35] [INFO ] After 418ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 33 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 04:52:35] [INFO ] Invariant cache hit.
[2023-03-08 04:52:35] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 04:52:35] [INFO ] Invariant cache hit.
[2023-03-08 04:52:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:35] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2023-03-08 04:52:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:52:35] [INFO ] Invariant cache hit.
[2023-03-08 04:52:35] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 299 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:35] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 04:52:35] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:35] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 129 ms returned sat
[2023-03-08 04:52:35] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2023-03-08 04:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 04:52:35] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 04:52:35] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 15 factoid took 802 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 202 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Product exploration explored 100000 steps with 2245 reset in 211 ms.
Product exploration explored 100000 steps with 2221 reset in 221 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 198 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 14 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:52:38] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:52:38] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:38] [INFO ] Invariant cache hit.
[2023-03-08 04:52:38] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 04:52:38] [INFO ] Invariant cache hit.
[2023-03-08 04:52:38] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-08 04:52:38] [INFO ] Invariant cache hit.
[2023-03-08 04:52:38] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-14 finished in 19901 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F((p1||G(p2))))))))'
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:38] [INFO ] Invariant cache hit.
[2023-03-08 04:52:38] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-08 04:52:38] [INFO ] Invariant cache hit.
[2023-03-08 04:52:38] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2023-03-08 04:52:38] [INFO ] Invariant cache hit.
[2023-03-08 04:52:38] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 153/153 places, 97/97 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s69 1)), p1:(AND (EQ s26 1) (EQ s69 1)), p2:(OR (EQ s46 0) (EQ s67 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2200 reset in 222 ms.
Product exploration explored 100000 steps with 2237 reset in 239 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 294 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 263 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:40] [INFO ] Invariant cache hit.
[2023-03-08 04:52:40] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 04:52:40] [INFO ] Invariant cache hit.
[2023-03-08 04:52:40] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-08 04:52:40] [INFO ] Invariant cache hit.
[2023-03-08 04:52:40] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 324 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 166 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2207 reset in 213 ms.
Product exploration explored 100000 steps with 2207 reset in 230 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 9 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:52:42] [INFO ] Invariant cache hit.
[2023-03-08 04:52:42] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:42] [INFO ] Invariant cache hit.
[2023-03-08 04:52:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 04:52:42] [INFO ] Invariant cache hit.
[2023-03-08 04:52:42] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 04:52:42] [INFO ] Invariant cache hit.
[2023-03-08 04:52:42] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-15 finished in 4301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((!p1||F(((!p2&&F((!p2&&X(G(!p3)))))||G((F(!p2)&&F(G(!p3)))))))))))'
Found a Lengthening insensitive property : DES-PT-10a-LTLFireability-14
Stuttering acceptance computed with spot in 612 ms :[(OR (AND p1 p2) (AND p1 p3)), (OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND (NOT p1) p2 p3), (AND p1 p3), false, p2, (AND p1 p2), false, (AND p3 p1), false, (AND p2 p1), false]
Support contains 8 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:52:43] [INFO ] Invariant cache hit.
[2023-03-08 04:52:43] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 04:52:43] [INFO ] Invariant cache hit.
[2023-03-08 04:52:43] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 04:52:43] [INFO ] Invariant cache hit.
[2023-03-08 04:52:43] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 291 ms. Remains : 153/153 places, 97/97 transitions.
Running random walk in product with property : DES-PT-10a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p1 p0), acceptance={} source=1 dest: 6}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 7}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=1 dest: 8}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 9}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 8}], [{ cond=(NOT p3), acceptance={1} source=4 dest: 4}, { cond=p3, acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p3 p0), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p3) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 p0), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 11}], [{ cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=7 dest: 10}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 14}], [{ cond=p2, acceptance={0, 1} source=8 dest: 8}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2 p0), acceptance={0, 1} source=9 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 14}], [{ cond=p1, acceptance={} source=11 dest: 4}, { cond=(NOT p1), acceptance={} source=11 dest: 11}], [{ cond=(AND p1 p2 (NOT p3)), acceptance={} source=12 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=12 dest: 12}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=12 dest: 14}], [{ cond=(AND p1 p2), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 12}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 14}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s72 1) (EQ s74 1)), p1:(AND (EQ s4 1) (EQ s72 1) (EQ s74 1)), p2:(AND (EQ s142 1) (EQ s147 1)), p3:(AND (EQ s105 1) (EQ s121 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2245 reset in 201 ms.
Product exploration explored 100000 steps with 2249 reset in 213 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 41 factoid took 1964 ms. Reduced automaton from 15 states, 53 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:52:46] [INFO ] Invariant cache hit.
[2023-03-08 04:52:46] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:46] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 04:52:46] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:47] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 123 ms returned sat
[2023-03-08 04:52:47] [INFO ] After 98ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:47] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 04:52:47] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 79 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 16 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1252801 steps, run timeout after 3001 ms. (steps per millisecond=417 ) properties seen :{}
Probabilistic random walk after 1252801 steps, saw 175146 distinct states, run finished after 3001 ms. (steps per millisecond=417 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:50] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:52:50] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 04:52:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:50] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 128 ms returned sat
[2023-03-08 04:52:50] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:50] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:50] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2023-03-08 04:52:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-08 04:52:50] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 04:52:51] [INFO ] After 428ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 48 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 04:52:51] [INFO ] Invariant cache hit.
[2023-03-08 04:52:51] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:52:51] [INFO ] Invariant cache hit.
[2023-03-08 04:52:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:51] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-08 04:52:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:52:51] [INFO ] Invariant cache hit.
[2023-03-08 04:52:51] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 302 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:51] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:52:51] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:51] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:51] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 125 ms returned sat
[2023-03-08 04:52:51] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:51] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-08 04:52:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-08 04:52:51] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 04:52:51] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p3) p0)))), (X (X (NOT (AND p1 p3 p0)))), (X (X (NOT (AND p1 p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), true, (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p0) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p1) p3 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 p3 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 41 factoid took 1792 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 224 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:52:54] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 04:52:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 04:52:54] [INFO ] Invariant cache hit.
[2023-03-08 04:52:54] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2023-03-08 04:52:54] [INFO ] Invariant cache hit.
[2023-03-08 04:52:54] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 278 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 583 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Incomplete random walk after 10000 steps, including 212 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:52:55] [INFO ] Invariant cache hit.
[2023-03-08 04:52:55] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:52:55] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 04:52:55] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:55] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 125 ms returned sat
[2023-03-08 04:52:55] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:55] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-08 04:52:55] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 79 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 153 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 17 ms. Remains 152 /153 variables (removed 1) and now considering 94/97 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 152/153 places, 94/97 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 803300 steps, run timeout after 3001 ms. (steps per millisecond=267 ) properties seen :{}
Probabilistic random walk after 803300 steps, saw 114783 distinct states, run finished after 3001 ms. (steps per millisecond=267 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:52:59] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 04:52:59] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:52:59] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:52:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:52:59] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 132 ms returned sat
[2023-03-08 04:52:59] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:52:59] [INFO ] After 24ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:52:59] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-08 04:52:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-08 04:52:59] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 04:52:59] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 46 ms.
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 2 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 04:52:59] [INFO ] Invariant cache hit.
[2023-03-08 04:52:59] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:52:59] [INFO ] Invariant cache hit.
[2023-03-08 04:53:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:53:00] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-08 04:53:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:53:00] [INFO ] Invariant cache hit.
[2023-03-08 04:53:00] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 152/152 places, 94/94 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 152 transition count 94
Applied a total of 1 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:53:00] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:53:00] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:53:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 04:53:00] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:53:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 04:53:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 122 ms returned sat
[2023-03-08 04:53:00] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:53:00] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-08 04:53:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 04:53:00] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 04:53:00] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p3)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), true, (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p3))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3))))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p1) p3)), (F p3), (F (AND p2 (NOT p1))), (F (NOT (AND (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p1)) (AND p2 (NOT p3)))))]
Knowledge based reduction with 15 factoid took 899 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 234 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Stuttering acceptance computed with spot in 227 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Product exploration explored 100000 steps with 2255 reset in 225 ms.
Product exploration explored 100000 steps with 2216 reset in 237 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 245 ms :[(OR (AND p1 p2) (AND p1 p3)), false, (OR (AND p1 p2) (AND p1 p3)), p3, (AND p2 (NOT p1) p3), p2]
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:53:03] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:53:03] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:53:03] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 7 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:53:03] [INFO ] Invariant cache hit.
[2023-03-08 04:53:03] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-08 04:53:03] [INFO ] Invariant cache hit.
[2023-03-08 04:53:03] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 04:53:03] [INFO ] Invariant cache hit.
[2023-03-08 04:53:03] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-14 finished in 20470 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(X(F((p1||G(p2))))))))'
Found a Shortening insensitive property : DES-PT-10a-LTLFireability-15
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:53:03] [INFO ] Invariant cache hit.
[2023-03-08 04:53:03] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:53:03] [INFO ] Invariant cache hit.
[2023-03-08 04:53:03] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 04:53:03] [INFO ] Invariant cache hit.
[2023-03-08 04:53:03] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 288 ms. Remains : 153/153 places, 97/97 transitions.
Running random walk in product with property : DES-PT-10a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s22 1) (EQ s69 1)), p1:(AND (EQ s26 1) (EQ s69 1)), p2:(OR (EQ s46 0) (EQ s67 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2228 reset in 223 ms.
Product exploration explored 100000 steps with 2209 reset in 237 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:53:05] [INFO ] Invariant cache hit.
[2023-03-08 04:53:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 04:53:05] [INFO ] Invariant cache hit.
[2023-03-08 04:53:05] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 04:53:05] [INFO ] Invariant cache hit.
[2023-03-08 04:53:05] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 187 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), true, (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2241 reset in 226 ms.
Product exploration explored 100000 steps with 2257 reset in 240 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:53:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:53:07] [INFO ] Invariant cache hit.
[2023-03-08 04:53:07] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:53:07] [INFO ] Invariant cache hit.
[2023-03-08 04:53:07] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 04:53:07] [INFO ] Invariant cache hit.
[2023-03-08 04:53:07] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 04:53:07] [INFO ] Invariant cache hit.
[2023-03-08 04:53:07] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 270 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLFireability-15 finished in 4422 ms.
[2023-03-08 04:53:07] [INFO ] Flatten gal took : 11 ms
[2023-03-08 04:53:07] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 04:53:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 97 transitions and 481 arcs took 1 ms.
Total runtime 66451 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-10a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

FORMULA DES-PT-10a-LTLFireability-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251283968

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: rewrite Frontend/Parser/formula_rewrite.k:373
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 5 (type EXCL) for 0 DES-PT-10a-LTLFireability-06
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 5 (type EXCL) for DES-PT-10a-LTLFireability-06
lola: result : false
lola: markings : 128739
lola: fired transitions : 220451
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 DES-PT-10a-LTLFireability-15
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 4/1799 5/32 DES-PT-10a-LTLFireability-15 650016 m, 130003 m/sec, 5288268 t fired, .

Time elapsed: 5 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 9/1799 9/32 DES-PT-10a-LTLFireability-15 1282004 m, 126397 m/sec, 10741542 t fired, .

Time elapsed: 10 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 14/1799 13/32 DES-PT-10a-LTLFireability-15 1898850 m, 123369 m/sec, 16068565 t fired, .

Time elapsed: 15 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 19/1799 19/32 DES-PT-10a-LTLFireability-15 2671221 m, 154474 m/sec, 21397808 t fired, .

Time elapsed: 20 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 24/1799 22/32 DES-PT-10a-LTLFireability-15 3220695 m, 109894 m/sec, 26756241 t fired, .

Time elapsed: 25 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 29/1799 26/32 DES-PT-10a-LTLFireability-15 3740673 m, 103995 m/sec, 32042059 t fired, .

Time elapsed: 30 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 34/1799 29/32 DES-PT-10a-LTLFireability-15 4195637 m, 90992 m/sec, 37298521 t fired, .

Time elapsed: 35 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 39/1799 32/32 DES-PT-10a-LTLFireability-15 4724428 m, 105758 m/sec, 42607980 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for DES-PT-10a-LTLFireability-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 8 (type EXCL) for 7 DES-PT-10a-LTLFireability-14
lola: time limit : 3555 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/3555 5/32 DES-PT-10a-LTLFireability-14 695499 m, 139099 m/sec, 4749872 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/3555 10/32 DES-PT-10a-LTLFireability-14 1339693 m, 128838 m/sec, 9516550 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/3555 14/32 DES-PT-10a-LTLFireability-14 1979266 m, 127914 m/sec, 14399632 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/3555 18/32 DES-PT-10a-LTLFireability-14 2507789 m, 105704 m/sec, 19914036 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/3555 20/32 DES-PT-10a-LTLFireability-14 2927551 m, 83952 m/sec, 25402611 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/3555 23/32 DES-PT-10a-LTLFireability-14 3382446 m, 90979 m/sec, 30868011 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/3555 26/32 DES-PT-10a-LTLFireability-14 3822004 m, 87911 m/sec, 36312710 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/3555 29/32 DES-PT-10a-LTLFireability-14 4264502 m, 88499 m/sec, 41687903 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/3555 32/32 DES-PT-10a-LTLFireability-14 4693459 m, 85791 m/sec, 46971044 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 8 (type EXCL) for DES-PT-10a-LTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLFireability-14: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLFireability-15: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLFireability-06: CONJ false LTL model checker
DES-PT-10a-LTLFireability-14: LTL unknown AGGR
DES-PT-10a-LTLFireability-15: LTL unknown AGGR


Time elapsed: 95 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is DES-PT-10a, 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 r103-tall-167814478300412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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