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.r265-smll-167863540000380.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 ltsminxred
Input is ParamProductionCell-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 8.4K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 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 ParamProductionCell-PT-2-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678988627441

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:43:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 17:43:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:43:50] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-16 17:43:50] [INFO ] Transformed 231 places.
[2023-03-16 17:43:50] [INFO ] Transformed 202 transitions.
[2023-03-16 17:43:50] [INFO ] Found NUPN structural information;
[2023-03-16 17:43:50] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-2-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 50 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-16 17:43:50] [INFO ] Computed 59 place invariants in 16 ms
[2023-03-16 17:43:51] [INFO ] Implicit Places using invariants in 645 ms returned [15, 16, 19, 24, 35, 36, 41, 42, 47, 59, 64, 65, 73, 78, 114, 117, 119, 120, 161, 162, 164, 166, 167, 192, 193, 196, 203, 218]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 691 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 199/231 places, 198/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 199 /199 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 755 ms. Remains : 199/231 places, 198/202 transitions.
Support contains 50 out of 199 places after structural reductions.
[2023-03-16 17:43:51] [INFO ] Flatten gal took : 64 ms
[2023-03-16 17:43:51] [INFO ] Flatten gal took : 27 ms
[2023-03-16 17:43:51] [INFO ] Input system was already deterministic with 198 transitions.
Support contains 48 out of 199 places (down from 50) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 32) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 199 cols
[2023-03-16 17:43:52] [INFO ] Computed 31 place invariants in 7 ms
[2023-03-16 17:43:52] [INFO ] [Real]Absence check using 24 positive place invariants in 12 ms returned sat
[2023-03-16 17:43:52] [INFO ] [Real]Absence check using 24 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-16 17:43:52] [INFO ] After 122ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 17:43:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:52] [INFO ] After 31ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:43:52] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:43:52] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2023-03-16 17:43:52] [INFO ] [Nat]Absence check using 24 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-16 17:43:52] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 17:43:53] [INFO ] After 51ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 9 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2023-03-16 17:43:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 801 ms
[2023-03-16 17:43:53] [INFO ] After 868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-16 17:43:53] [INFO ] After 1108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 199 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 182 transition count 181
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 34 place count 182 transition count 164
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 129 transition count 128
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 145 place count 129 transition count 123
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 150 place count 124 transition count 123
Applied a total of 150 rules in 57 ms. Remains 124 /199 variables (removed 75) and now considering 123/198 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 124/199 places, 123/198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Finished probabilistic random walk after 33163 steps, run visited all 1 properties in 141 ms. (steps per millisecond=235 )
Probabilistic random walk after 33163 steps, saw 9913 distinct states, run finished after 141 ms. (steps per millisecond=235 ) properties seen :1
FORMULA ParamProductionCell-PT-2-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 9 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:43:54] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-16 17:43:54] [INFO ] Implicit Places using invariants in 222 ms returned [27, 38, 65, 84, 85, 87, 99, 174, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 223 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 8 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 17:43:54] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-16 17:43:54] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-16 17:43:55] [INFO ] Invariant cache hit.
[2023-03-16 17:43:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:55] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 732 ms. Remains : 186/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s160 1) (EQ s167 1) (EQ s16 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 20 reset in 446 ms.
Stack based approach found an accepted trace after 463 steps with 0 reset with depth 464 and stack size 464 in 3 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-00 finished in 1531 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)))'
Support contains 1 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 199 transition count 182
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 183 transition count 182
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 32 place count 183 transition count 164
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 136 place count 131 transition count 130
Applied a total of 136 rules in 34 ms. Remains 131 /199 variables (removed 68) and now considering 130/198 (removed 68) transitions.
// Phase 1: matrix 130 rows 131 cols
[2023-03-16 17:43:56] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-16 17:43:56] [INFO ] Implicit Places using invariants in 174 ms returned [12, 19, 26, 42, 52, 53, 55, 67, 114, 117, 119]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 177 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/199 places, 130/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 120 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 117 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 117 transition count 125
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 115 transition count 125
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 113 transition count 123
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 113 transition count 123
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 68 place count 86 transition count 96
Applied a total of 68 rules in 20 ms. Remains 86 /120 variables (removed 34) and now considering 96/130 (removed 34) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-16 17:43:56] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:43:56] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-16 17:43:56] [INFO ] Invariant cache hit.
[2023-03-16 17:43:56] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:56] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/199 places, 96/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 523 ms. Remains : 86/199 places, 96/198 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 836 reset in 192 ms.
Product exploration explored 100000 steps with 817 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 79 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-16 17:43:57] [INFO ] Invariant cache hit.
[2023-03-16 17:43:57] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-16 17:43:57] [INFO ] Invariant cache hit.
[2023-03-16 17:43:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:57] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-16 17:43:57] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:57] [INFO ] Invariant cache hit.
[2023-03-16 17:43:58] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 86/86 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 86 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 844 reset in 131 ms.
Product exploration explored 100000 steps with 832 reset in 141 ms.
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-16 17:43:58] [INFO ] Invariant cache hit.
[2023-03-16 17:43:59] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-16 17:43:59] [INFO ] Invariant cache hit.
[2023-03-16 17:43:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:43:59] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2023-03-16 17:43:59] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:43:59] [INFO ] Invariant cache hit.
[2023-03-16 17:43:59] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 411 ms. Remains : 86/86 places, 96/96 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-01 finished in 3270 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((F((F(p1)&&p0))||p2))) U p1))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 8 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:43:59] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:43:59] [INFO ] Implicit Places using invariants in 177 ms returned [27, 38, 65, 84, 85, 87, 99, 169, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 181 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 7 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 17:43:59] [INFO ] Computed 22 place invariants in 3 ms
[2023-03-16 17:43:59] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-16 17:43:59] [INFO ] Invariant cache hit.
[2023-03-16 17:43:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:00] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 676 ms. Remains : 186/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s19 1)), p2:(AND (EQ s164 1) (EQ s170 1)), p0:(AND (EQ s35 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 845 reset in 149 ms.
Product exploration explored 100000 steps with 845 reset in 153 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 438 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 127 steps, including 0 resets, run visited all 5 properties in 9 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-16 17:44:02] [INFO ] Invariant cache hit.
[2023-03-16 17:44:02] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:02] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:02] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-16 17:44:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:02] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 17:44:02] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:03] [INFO ] [Nat]Absence check using state equation in 196 ms returned sat
[2023-03-16 17:44:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:03] [INFO ] [Nat]Added 68 Read/Feed constraints in 22 ms returned sat
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-16 17:44:03] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 0 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 0 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 0 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:44:04] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2023-03-16 17:44:05] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2023-03-16 17:44:05] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:05] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2023-03-16 17:44:05] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2069 ms
[2023-03-16 17:44:05] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-16 17:44:06] [INFO ] Added : 181 causal constraints over 37 iterations in 817 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-16 17:44:06] [INFO ] Invariant cache hit.
[2023-03-16 17:44:06] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:44:06] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:06] [INFO ] [Real]Absence check using state equation in 213 ms returned sat
[2023-03-16 17:44:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:44:06] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:06] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-16 17:44:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:06] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2023-03-16 17:44:06] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2023-03-16 17:44:06] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-16 17:44:06] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 1 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
[2023-03-16 17:44:07] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 1 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-16 17:44:08] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2071 ms
[2023-03-16 17:44:08] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-16 17:44:09] [INFO ] Added : 104 causal constraints over 21 iterations in 592 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-16 17:44:09] [INFO ] Invariant cache hit.
[2023-03-16 17:44:09] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-16 17:44:09] [INFO ] Invariant cache hit.
[2023-03-16 17:44:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:09] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2023-03-16 17:44:09] [INFO ] Invariant cache hit.
[2023-03-16 17:44:10] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 186/186 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 500 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 117 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 619 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-16 17:44:11] [INFO ] Invariant cache hit.
[2023-03-16 17:44:12] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:12] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:12] [INFO ] [Real]Absence check using state equation in 240 ms returned sat
[2023-03-16 17:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:12] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:44:12] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:12] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-16 17:44:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:12] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2023-03-16 17:44:12] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:44:12] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:44:12] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 0 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 0 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:44:13] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 53 places in 55 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2023-03-16 17:44:14] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1961 ms
[2023-03-16 17:44:14] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-16 17:44:15] [INFO ] Added : 181 causal constraints over 37 iterations in 763 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-16 17:44:15] [INFO ] Invariant cache hit.
[2023-03-16 17:44:15] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:15] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 17:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:15] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-16 17:44:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:15] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-16 17:44:15] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:16] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-16 17:44:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:16] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 0 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 0 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:44:16] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 1 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:44:17] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-16 17:44:18] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:18] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1929 ms
[2023-03-16 17:44:18] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-16 17:44:18] [INFO ] Added : 104 causal constraints over 21 iterations in 551 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 842 reset in 137 ms.
Product exploration explored 100000 steps with 843 reset in 156 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 186 transition count 194
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 31 place count 186 transition count 194
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 47 place count 186 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 54 place count 179 transition count 187
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 61 place count 179 transition count 187
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 103 place count 179 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 127 place count 155 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 151 place count 155 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 151 rules in 35 ms. Remains 155 /186 variables (removed 31) and now considering 163/194 (removed 31) transitions.
[2023-03-16 17:44:19] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 163 rows 155 cols
[2023-03-16 17:44:19] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:44:19] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/186 places, 163/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 155/186 places, 163/194 transitions.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 17:44:19] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-16 17:44:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-16 17:44:19] [INFO ] Invariant cache hit.
[2023-03-16 17:44:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:20] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-16 17:44:20] [INFO ] Invariant cache hit.
[2023-03-16 17:44:20] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 669 ms. Remains : 186/186 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 21107 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((G(p1)||p0))&&F(G(p2)))))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 199 transition count 185
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 186 transition count 183
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 184 transition count 183
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 30 place count 184 transition count 164
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 128 place count 135 transition count 134
Applied a total of 128 rules in 26 ms. Remains 135 /199 variables (removed 64) and now considering 134/198 (removed 64) transitions.
// Phase 1: matrix 134 rows 135 cols
[2023-03-16 17:44:20] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-16 17:44:20] [INFO ] Implicit Places using invariants in 138 ms returned [12, 19, 42, 52, 55, 118, 121, 123]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 142 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/199 places, 134/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 127 transition count 132
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 125 transition count 132
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 123 transition count 130
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 123 transition count 130
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 115 transition count 122
Applied a total of 24 rules in 15 ms. Remains 115 /127 variables (removed 12) and now considering 122/134 (removed 12) transitions.
// Phase 1: matrix 122 rows 115 cols
[2023-03-16 17:44:20] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-16 17:44:20] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-16 17:44:20] [INFO ] Invariant cache hit.
[2023-03-16 17:44:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:21] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/199 places, 122/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 559 ms. Remains : 115/199 places, 122/198 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s40 0) (EQ s56 0)), p1:(OR (EQ s19 0) (EQ s20 0) (EQ s24 0)), p2:(AND (EQ s44 1) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Stack based approach found an accepted trace after 327 steps with 0 reset with depth 328 and stack size 328 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-04 finished in 831 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||G(p1)))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 199 transition count 182
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 183 transition count 182
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 32 place count 183 transition count 164
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 138 place count 130 transition count 129
Applied a total of 138 rules in 17 ms. Remains 130 /199 variables (removed 69) and now considering 129/198 (removed 69) transitions.
// Phase 1: matrix 129 rows 130 cols
[2023-03-16 17:44:21] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:44:21] [INFO ] Implicit Places using invariants in 171 ms returned [13, 20, 27, 41, 51, 52, 54, 66, 113, 116, 118]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 173 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/199 places, 129/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 119 transition count 126
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 116 transition count 126
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 116 transition count 124
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 114 transition count 124
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 112 transition count 122
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 112 transition count 122
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 66 place count 86 transition count 96
Applied a total of 66 rules in 15 ms. Remains 86 /119 variables (removed 33) and now considering 96/129 (removed 33) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-16 17:44:21] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-16 17:44:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-16 17:44:21] [INFO ] Invariant cache hit.
[2023-03-16 17:44:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:21] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/199 places, 96/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 491 ms. Remains : 86/199 places, 96/198 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s16 1) (EQ s20 1)), p0:(AND (EQ s40 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 207 reset in 150 ms.
Stack based approach found an accepted trace after 125 steps with 0 reset with depth 126 and stack size 126 in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-07 finished in 731 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(p0)||X(F(p1))))'
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 4 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:44:22] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:44:22] [INFO ] Implicit Places using invariants in 202 ms returned [16, 27, 38, 65, 84, 85, 87, 99, 169, 174]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 204 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:44:22] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:44:22] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-16 17:44:22] [INFO ] Invariant cache hit.
[2023-03-16 17:44:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:22] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 655 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s84 1) (EQ s104 1)), p0:(AND (EQ s166 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 62 reset in 127 ms.
Stack based approach found an accepted trace after 418 steps with 0 reset with depth 419 and stack size 419 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-08 finished in 904 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 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 3 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:44:22] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:44:23] [INFO ] Implicit Places using invariants in 219 ms returned [16, 27, 38, 65, 84, 85, 87, 99, 169, 174]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 221 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:44:23] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 17:44:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-16 17:44:23] [INFO ] Invariant cache hit.
[2023-03-16 17:44:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:23] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 772 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s166 0) (EQ s179 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 6 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-09 finished in 885 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(!X(X(p0))) U p1)&&F(p2)))'
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 4 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:44:23] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-16 17:44:24] [INFO ] Implicit Places using invariants in 235 ms returned [16, 38, 65, 84, 85, 87, 99, 169, 174, 178]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 236 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 3 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:44:24] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-16 17:44:24] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-16 17:44:24] [INFO ] Invariant cache hit.
[2023-03-16 17:44:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:24] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 698 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) p0), p0]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s173 1) (EQ s180 1)), p1:(AND (EQ s17 1) (EQ s26 1) (EQ s29 1)), p0:(AND (EQ s79 1) (EQ s99 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1206 reset in 197 ms.
Product exploration explored 100000 steps with 1143 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 259 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Finished random walk after 881 steps, including 0 resets, run visited all 3 properties in 16 ms. (steps per millisecond=55 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 306 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
[2023-03-16 17:44:26] [INFO ] Invariant cache hit.
[2023-03-16 17:44:26] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 17:44:26] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:26] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-16 17:44:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 17:44:26] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:26] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-16 17:44:26] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:26] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2023-03-16 17:44:26] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 77 places in 73 ms of which 0 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:27] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 1 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:28] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1949 ms
[2023-03-16 17:44:28] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-16 17:44:29] [INFO ] Added : 164 causal constraints over 33 iterations in 576 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-16 17:44:29] [INFO ] Invariant cache hit.
[2023-03-16 17:44:29] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-16 17:44:29] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-16 17:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:29] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-16 17:44:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:29] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 17:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:30] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2023-03-16 17:44:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:30] [INFO ] [Nat]Added 68 Read/Feed constraints in 28 ms returned sat
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-16 17:44:30] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 3 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2023-03-16 17:44:31] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1584 ms
[2023-03-16 17:44:31] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-16 17:44:32] [INFO ] Added : 172 causal constraints over 35 iterations in 751 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-16 17:44:32] [INFO ] Invariant cache hit.
[2023-03-16 17:44:32] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-16 17:44:32] [INFO ] Invariant cache hit.
[2023-03-16 17:44:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:33] [INFO ] Implicit Places using invariants and state equation in 338 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-16 17:44:33] [INFO ] Invariant cache hit.
[2023-03-16 17:44:33] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Finished random walk after 2012 steps, including 0 resets, run visited all 3 properties in 9 ms. (steps per millisecond=223 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p2))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F p1)]
Knowledge based reduction with 6 factoid took 298 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
[2023-03-16 17:44:34] [INFO ] Invariant cache hit.
[2023-03-16 17:44:34] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 17:44:34] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:34] [INFO ] [Real]Absence check using state equation in 224 ms returned sat
[2023-03-16 17:44:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:34] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:34] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:34] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2023-03-16 17:44:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:35] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 77 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 57 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-16 17:44:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 0 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 39 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2023-03-16 17:44:36] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 1911 ms
[2023-03-16 17:44:36] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-16 17:44:37] [INFO ] Added : 164 causal constraints over 33 iterations in 563 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-16 17:44:37] [INFO ] Invariant cache hit.
[2023-03-16 17:44:37] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 17:44:37] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-16 17:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:37] [INFO ] [Real]Absence check using state equation in 261 ms returned sat
[2023-03-16 17:44:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:38] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:38] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2023-03-16 17:44:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:38] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 0 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-16 17:44:38] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2023-03-16 17:44:39] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1532 ms
[2023-03-16 17:44:39] [INFO ] Computed and/alt/rep : 192/311/192 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-16 17:44:40] [INFO ] Added : 172 causal constraints over 35 iterations in 746 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 1134 reset in 129 ms.
Product exploration explored 100000 steps with 1155 reset in 154 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 185 transition count 194
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 36 place count 185 transition count 194
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 50 place count 185 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 58 place count 177 transition count 186
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 66 place count 177 transition count 186
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 112 place count 177 transition count 186
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 141 place count 148 transition count 157
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 170 place count 148 transition count 157
Deduced a syphon composed of 59 places in 0 ms
Applied a total of 170 rules in 19 ms. Remains 148 /185 variables (removed 37) and now considering 157/194 (removed 37) transitions.
[2023-03-16 17:44:41] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 157 rows 148 cols
[2023-03-16 17:44:41] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:44:41] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/185 places, 157/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 148/185 places, 157/194 transitions.
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:44:41] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:44:41] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-16 17:44:41] [INFO ] Invariant cache hit.
[2023-03-16 17:44:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:41] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2023-03-16 17:44:41] [INFO ] Invariant cache hit.
[2023-03-16 17:44:42] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-10 finished in 18283 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 (p1 U p2))||(p3 U p2)))'
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 3 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:44:42] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:44:42] [INFO ] Implicit Places using invariants in 143 ms returned [16, 27, 38, 65, 84, 99, 169, 174, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 144 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 188/199 places, 196/198 transitions.
Stuttering acceptance computed with spot in 317 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 p3), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p3 (NOT p0)), acceptance={0} source=3 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3) p0), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3 p0), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3) p0), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1 p3 p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p2) p1 p3 (NOT p0)), acceptance={0} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p3 (NOT p0)), acceptance={0} source=5 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p3), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=8 dest: 0}, { cond=(AND (NOT p2) p3), acceptance={0} source=8 dest: 8}]], initial=2, aps=[p0:(AND (EQ s2 1) (EQ s160 1)), p2:(AND (EQ s80 1) (EQ s128 1)), p1:(AND (EQ s78 1) (EQ s124 1)), p3:(AND (EQ s82 1) (EQ s89 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-11 finished in 493 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((p0||G((X(p2)&&p1))))))'
Support contains 5 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 4 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
[2023-03-16 17:44:42] [INFO ] Invariant cache hit.
[2023-03-16 17:44:42] [INFO ] Implicit Places using invariants in 206 ms returned [16, 27, 38, 65, 84, 85, 87, 99, 174, 178]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 210 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 17:44:42] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:44:42] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-16 17:44:42] [INFO ] Invariant cache hit.
[2023-03-16 17:44:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:43] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 673 ms. Remains : 185/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (EQ s83 1) (EQ s121 1)), p1:(AND (EQ s159 1) (EQ s178 1)), p2:(OR (EQ s159 0) (EQ s178 0) (EQ s164 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-12 finished in 846 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(p2)||p1)))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 198 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 198 transition count 197
Applied a total of 2 rules in 4 ms. Remains 198 /199 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 198 cols
[2023-03-16 17:44:43] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:44:43] [INFO ] Implicit Places using invariants in 207 ms returned [16, 27, 38, 65, 85, 87, 100, 170, 175, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 208 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 214 ms. Remains : 188/199 places, 197/198 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s85 0) (EQ s124 0)), p0:(AND (EQ s14 1) (EQ s118 1)), p2:(OR (EQ s80 0) (EQ s86 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2224 reset in 143 ms.
Product exploration explored 100000 steps with 2219 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0) p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 494 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 197 rows 188 cols
[2023-03-16 17:44:44] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:44:44] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:44:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-16 17:44:44] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:44] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0) p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 14 factoid took 612 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-16 17:44:45] [INFO ] Invariant cache hit.
[2023-03-16 17:44:45] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-16 17:44:45] [INFO ] Invariant cache hit.
[2023-03-16 17:44:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:46] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2023-03-16 17:44:46] [INFO ] Invariant cache hit.
[2023-03-16 17:44:46] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 631 ms. Remains : 188/188 places, 197/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 345 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 3259 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=271 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 9 factoid took 427 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 2237 reset in 149 ms.
Product exploration explored 100000 steps with 2214 reset in 172 ms.
Support contains 6 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2023-03-16 17:44:47] [INFO ] Invariant cache hit.
[2023-03-16 17:44:47] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-16 17:44:47] [INFO ] Invariant cache hit.
[2023-03-16 17:44:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:48] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-16 17:44:48] [INFO ] Invariant cache hit.
[2023-03-16 17:44:48] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 638 ms. Remains : 188/188 places, 197/197 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-13 finished in 4918 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(p0)))'
Support contains 2 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 199 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 182 transition count 181
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 34 place count 182 transition count 164
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 164 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 164 transition count 163
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 130 transition count 129
Applied a total of 138 rules in 13 ms. Remains 130 /199 variables (removed 69) and now considering 129/198 (removed 69) transitions.
// Phase 1: matrix 129 rows 130 cols
[2023-03-16 17:44:48] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:44:48] [INFO ] Implicit Places using invariants in 147 ms returned [12, 19, 26, 40, 50, 51, 65, 113, 116, 118]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 148 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/199 places, 129/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 126
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 126
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 44 place count 98 transition count 107
Applied a total of 44 rules in 7 ms. Remains 98 /120 variables (removed 22) and now considering 107/129 (removed 22) transitions.
// Phase 1: matrix 107 rows 98 cols
[2023-03-16 17:44:48] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:44:48] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-16 17:44:48] [INFO ] Invariant cache hit.
[2023-03-16 17:44:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:48] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/199 places, 107/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 455 ms. Remains : 98/199 places, 107/198 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 131 ms.
Stack based approach found an accepted trace after 188 steps with 0 reset with depth 189 and stack size 189 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-14 finished in 731 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)&&X((F(G(p2))&&p1)))))))'
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 197 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 197 transition count 196
Applied a total of 4 rules in 5 ms. Remains 197 /199 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:44:49] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:44:49] [INFO ] Implicit Places using invariants in 198 ms returned [16, 27, 38, 84, 85, 87, 99, 174, 178]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 200 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/199 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 17:44:49] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 17:44:49] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-16 17:44:49] [INFO ] Invariant cache hit.
[2023-03-16 17:44:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:49] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/199 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 700 ms. Remains : 186/199 places, 194/198 transitions.
Stuttering acceptance computed with spot in 290 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}, { cond=p1, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p2, acceptance={} source=7 dest: 7}, { cond=(NOT p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s160 0) (EQ s175 0)), p1:(AND (EQ s62 1) (EQ s64 1)), p2:(AND (EQ s84 1) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-15 finished in 1013 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)))'
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((F((F(p1)&&p0))||p2))) U p1))'
Found a Lengthening insensitive property : ParamProductionCell-PT-2-LTLFireability-02
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 199 transition count 183
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 184 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 183 transition count 182
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 32 place count 183 transition count 164
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 132 place count 133 transition count 132
Applied a total of 132 rules in 14 ms. Remains 133 /199 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 133 cols
[2023-03-16 17:44:50] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:44:50] [INFO ] Implicit Places using invariants in 185 ms returned [21, 28, 43, 53, 54, 56, 68, 115, 121]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 186 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/199 places, 132/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 129
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 129
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 121 transition count 127
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 119 transition count 127
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 117 transition count 125
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 117 transition count 125
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 58 place count 95 transition count 103
Applied a total of 58 rules in 10 ms. Remains 95 /124 variables (removed 29) and now considering 103/132 (removed 29) transitions.
// Phase 1: matrix 103 rows 95 cols
[2023-03-16 17:44:50] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-16 17:44:50] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-16 17:44:50] [INFO ] Invariant cache hit.
[2023-03-16 17:44:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:50] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 95/199 places, 103/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 498 ms. Remains : 95/199 places, 103/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s14 1)), p2:(AND (EQ s86 1) (EQ s88 1)), p0:(AND (EQ s24 1) (EQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1725 reset in 144 ms.
Product exploration explored 100000 steps with 1721 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 405 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 67 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p1))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 515 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-16 17:44:52] [INFO ] Invariant cache hit.
[2023-03-16 17:44:52] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:44:52] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-16 17:44:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 17:44:53] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:53] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-16 17:44:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:53] [INFO ] [Nat]Added 68 Read/Feed constraints in 15 ms returned sat
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2023-03-16 17:44:53] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 859 ms
[2023-03-16 17:44:54] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 17:44:54] [INFO ] Added : 86 causal constraints over 19 iterations in 219 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-16 17:44:54] [INFO ] Invariant cache hit.
[2023-03-16 17:44:54] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-03-16 17:44:54] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-16 17:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:54] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-16 17:44:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:44:54] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:54] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-16 17:44:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:54] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:44:54] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:44:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 795 ms
[2023-03-16 17:44:55] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:44:55] [INFO ] Added : 97 causal constraints over 22 iterations in 259 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 1 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-16 17:44:55] [INFO ] Invariant cache hit.
[2023-03-16 17:44:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-16 17:44:55] [INFO ] Invariant cache hit.
[2023-03-16 17:44:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:56] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-16 17:44:56] [INFO ] Invariant cache hit.
[2023-03-16 17:44:56] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 387 ms. Remains : 95/95 places, 103/103 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 458 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Finished random walk after 52 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p1))), true, (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND (NOT p1) p0)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 11 factoid took 564 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
[2023-03-16 17:44:57] [INFO ] Invariant cache hit.
[2023-03-16 17:44:57] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-16 17:44:57] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:57] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-16 17:44:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:57] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 17:44:57] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:58] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-16 17:44:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:58] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2023-03-16 17:44:58] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 854 ms
[2023-03-16 17:44:58] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:44:59] [INFO ] Added : 86 causal constraints over 19 iterations in 220 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-16 17:44:59] [INFO ] Invariant cache hit.
[2023-03-16 17:44:59] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 17:44:59] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:59] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-16 17:44:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:44:59] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 17:44:59] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:44:59] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-16 17:44:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:44:59] [INFO ] [Nat]Added 68 Read/Feed constraints in 13 ms returned sat
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 3 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:44:59] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:00] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 803 ms
[2023-03-16 17:45:00] [INFO ] Computed and/alt/rep : 101/228/101 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:45:00] [INFO ] Added : 97 causal constraints over 22 iterations in 254 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Product exploration explored 100000 steps with 1715 reset in 142 ms.
Product exploration explored 100000 steps with 1718 reset in 159 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p1)]
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 2 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-16 17:45:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 17:45:01] [INFO ] Invariant cache hit.
[2023-03-16 17:45:01] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 95/95 places, 103/103 transitions.
Support contains 6 out of 95 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 95/95 places, 103/103 transitions.
Applied a total of 0 rules in 0 ms. Remains 95 /95 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2023-03-16 17:45:01] [INFO ] Invariant cache hit.
[2023-03-16 17:45:01] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-16 17:45:01] [INFO ] Invariant cache hit.
[2023-03-16 17:45:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:01] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-16 17:45:01] [INFO ] Invariant cache hit.
[2023-03-16 17:45:01] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 95/95 places, 103/103 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 11606 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(!X(X(p0))) U p1)&&F(p2)))'
Found a Shortening insensitive property : ParamProductionCell-PT-2-LTLFireability-10
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) p0), p0]
Support contains 7 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 199 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 182 transition count 181
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 34 place count 182 transition count 164
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 68 place count 165 transition count 164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 163 transition count 162
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 163 transition count 162
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 140 place count 129 transition count 128
Applied a total of 140 rules in 12 ms. Remains 129 /199 variables (removed 70) and now considering 128/198 (removed 70) transitions.
// Phase 1: matrix 128 rows 129 cols
[2023-03-16 17:45:02] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:45:02] [INFO ] Implicit Places using invariants in 173 ms returned [12, 26, 40, 50, 51, 53, 65, 112, 115, 117]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 175 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 119/199 places, 128/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 119 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 116 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 116 transition count 123
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 114 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 112 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 112 transition count 121
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 64 place count 87 transition count 96
Applied a total of 64 rules in 8 ms. Remains 87 /119 variables (removed 32) and now considering 96/128 (removed 32) transitions.
// Phase 1: matrix 96 rows 87 cols
[2023-03-16 17:45:02] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-16 17:45:02] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-16 17:45:02] [INFO ] Invariant cache hit.
[2023-03-16 17:45:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:02] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 87/199 places, 96/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 443 ms. Remains : 87/199 places, 96/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s83 1) (EQ s84 1)), p1:(AND (EQ s11 1) (EQ s15 1) (EQ s17 1)), p0:(AND (EQ s39 1) (EQ s50 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2574 reset in 131 ms.
Product exploration explored 100000 steps with 2605 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Finished random walk after 681 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=227 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 322 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
[2023-03-16 17:45:03] [INFO ] Invariant cache hit.
[2023-03-16 17:45:03] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:45:03] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:03] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-16 17:45:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:45:04] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-16 17:45:04] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-16 17:45:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:04] [INFO ] [Nat]Added 68 Read/Feed constraints in 10 ms returned sat
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-16 17:45:04] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 897 ms
[2023-03-16 17:45:04] [INFO ] Computed and/alt/rep : 94/221/94 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 17:45:05] [INFO ] Added : 89 causal constraints over 19 iterations in 210 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-16 17:45:05] [INFO ] Invariant cache hit.
[2023-03-16 17:45:05] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:45:05] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:05] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-16 17:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:45:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:45:05] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:05] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-16 17:45:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:05] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2023-03-16 17:45:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-16 17:45:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 540 ms
[2023-03-16 17:45:06] [INFO ] Computed and/alt/rep : 94/221/94 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 17:45:06] [INFO ] Added : 78 causal constraints over 17 iterations in 181 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 7 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 96/96 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-16 17:45:06] [INFO ] Invariant cache hit.
[2023-03-16 17:45:06] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-16 17:45:06] [INFO ] Invariant cache hit.
[2023-03-16 17:45:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:06] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2023-03-16 17:45:06] [INFO ] Invariant cache hit.
[2023-03-16 17:45:06] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 514 ms. Remains : 87/87 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 5 factoid took 236 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Finished random walk after 246 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p2)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (F p2), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
[2023-03-16 17:45:07] [INFO ] Invariant cache hit.
[2023-03-16 17:45:07] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:45:07] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:07] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-16 17:45:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:45:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 17:45:07] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:08] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2023-03-16 17:45:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:08] [INFO ] [Nat]Added 68 Read/Feed constraints in 11 ms returned sat
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-16 17:45:08] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 902 ms
[2023-03-16 17:45:08] [INFO ] Computed and/alt/rep : 94/221/94 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 17:45:09] [INFO ] Added : 89 causal constraints over 19 iterations in 215 ms. Result :sat
Could not prove EG (NOT p1)
[2023-03-16 17:45:09] [INFO ] Invariant cache hit.
[2023-03-16 17:45:09] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 17:45:09] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 17:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:09] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-16 17:45:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:45:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 17:45:09] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:45:09] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-16 17:45:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:09] [INFO ] [Nat]Added 68 Read/Feed constraints in 12 ms returned sat
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:45:09] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:45:10] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2023-03-16 17:45:10] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2023-03-16 17:45:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 531 ms
[2023-03-16 17:45:10] [INFO ] Computed and/alt/rep : 94/221/94 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:45:10] [INFO ] Added : 78 causal constraints over 17 iterations in 190 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Product exploration explored 100000 steps with 2537 reset in 143 ms.
Product exploration explored 100000 steps with 2553 reset in 151 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p2) p0), (NOT p2), (OR (NOT p1) p0), p0]
Support contains 7 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-16 17:45:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-16 17:45:10] [INFO ] Invariant cache hit.
[2023-03-16 17:45:11] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 87/87 places, 96/96 transitions.
Support contains 7 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2023-03-16 17:45:11] [INFO ] Invariant cache hit.
[2023-03-16 17:45:11] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-16 17:45:11] [INFO ] Invariant cache hit.
[2023-03-16 17:45:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:11] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-16 17:45:11] [INFO ] Invariant cache hit.
[2023-03-16 17:45:11] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 87/87 places, 96/96 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-10 finished in 9645 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(p2)||p1)))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-2-LTLFireability-13
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Support contains 6 out of 199 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 199/199 places, 198/198 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 199 transition count 181
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 182 transition count 181
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 34 place count 182 transition count 165
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 66 place count 166 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 165 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 165 transition count 164
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 128 place count 135 transition count 134
Applied a total of 128 rules in 11 ms. Remains 135 /199 variables (removed 64) and now considering 134/198 (removed 64) transitions.
// Phase 1: matrix 134 rows 135 cols
[2023-03-16 17:45:11] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:45:11] [INFO ] Implicit Places using invariants in 184 ms returned [12, 19, 26, 40, 53, 55, 68, 118, 121, 123]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 186 ms to find 10 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 125/199 places, 134/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 125 transition count 131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 122 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 122 transition count 130
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 121 transition count 130
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 56 place count 97 transition count 106
Applied a total of 56 rules in 7 ms. Remains 97 /125 variables (removed 28) and now considering 106/134 (removed 28) transitions.
// Phase 1: matrix 106 rows 97 cols
[2023-03-16 17:45:11] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-16 17:45:11] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-16 17:45:11] [INFO ] Invariant cache hit.
[2023-03-16 17:45:12] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:12] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 97/199 places, 106/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 515 ms. Remains : 97/199 places, 106/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s44 0) (EQ s66 0)), p0:(AND (EQ s7 1) (EQ s62 1)), p2:(OR (EQ s40 0) (EQ s45 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4945 reset in 150 ms.
Product exploration explored 100000 steps with 4984 reset in 169 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0) p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 480 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 17:45:13] [INFO ] Invariant cache hit.
[2023-03-16 17:45:13] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:45:13] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-16 17:45:13] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 17:45:13] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0) p2)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0) p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1 (NOT p2))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 14 factoid took 642 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-16 17:45:14] [INFO ] Invariant cache hit.
[2023-03-16 17:45:14] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-16 17:45:14] [INFO ] Invariant cache hit.
[2023-03-16 17:45:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:14] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-16 17:45:14] [INFO ] Invariant cache hit.
[2023-03-16 17:45:14] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 97/97 places, 106/106 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 350 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 2524 steps, including 0 resets, run visited all 4 properties in 7 ms. (steps per millisecond=360 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p1 p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p1 p2)))]
Knowledge based reduction with 9 factoid took 440 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 4967 reset in 156 ms.
Product exploration explored 100000 steps with 4974 reset in 174 ms.
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-16 17:45:15] [INFO ] Invariant cache hit.
[2023-03-16 17:45:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-16 17:45:16] [INFO ] Invariant cache hit.
[2023-03-16 17:45:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:45:16] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-16 17:45:16] [INFO ] Invariant cache hit.
[2023-03-16 17:45:16] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 97/97 places, 106/106 transitions.
Treatment of property ParamProductionCell-PT-2-LTLFireability-13 finished in 4923 ms.
[2023-03-16 17:45:16] [INFO ] Flatten gal took : 17 ms
[2023-03-16 17:45:16] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 17:45:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 198 transitions and 706 arcs took 3 ms.
Total runtime 86021 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3836/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3836/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3836/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/3836/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-2-LTLFireability-01
Could not compute solution for formula : ParamProductionCell-PT-2-LTLFireability-02
Could not compute solution for formula : ParamProductionCell-PT-2-LTLFireability-10
Could not compute solution for formula : ParamProductionCell-PT-2-LTLFireability-13

BK_STOP 1678988718191

--------------------
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
mcc2023
ltl formula name ParamProductionCell-PT-2-LTLFireability-01
ltl formula formula --ltl=/tmp/3836/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 199 places, 198 transitions and 706 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3836/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3836/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3836/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3836/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55b6dfb8d3f4]
1: pnml2lts-mc(+0xa2496) [0x55b6dfb8d496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fd6ea269140]
3: pnml2lts-mc(+0x405be5) [0x55b6dfef0be5]
4: pnml2lts-mc(+0x16b3f9) [0x55b6dfc563f9]
5: pnml2lts-mc(+0x164ac4) [0x55b6dfc4fac4]
6: pnml2lts-mc(+0x272e0a) [0x55b6dfd5de0a]
7: pnml2lts-mc(+0xb61f0) [0x55b6dfba11f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fd6ea0bc4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fd6ea0bc67a]
10: pnml2lts-mc(+0xa1581) [0x55b6dfb8c581]
11: pnml2lts-mc(+0xa1910) [0x55b6dfb8c910]
12: pnml2lts-mc(+0xa32a2) [0x55b6dfb8e2a2]
13: pnml2lts-mc(+0xa50f4) [0x55b6dfb900f4]
14: pnml2lts-mc(+0xa516b) [0x55b6dfb9016b]
15: pnml2lts-mc(+0x3f34b3) [0x55b6dfede4b3]
16: pnml2lts-mc(+0x7c63d) [0x55b6dfb6763d]
17: pnml2lts-mc(+0x67d86) [0x55b6dfb52d86]
18: pnml2lts-mc(+0x60a8a) [0x55b6dfb4ba8a]
19: pnml2lts-mc(+0x5eb15) [0x55b6dfb49b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fd6ea0a4d0a]
21: pnml2lts-mc(+0x6075e) [0x55b6dfb4b75e]
ltl formula name ParamProductionCell-PT-2-LTLFireability-02
ltl formula formula --ltl=/tmp/3836/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 199 places, 198 transitions and 706 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3836/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3836/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3836/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3836/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ParamProductionCell-PT-2-LTLFireability-10
ltl formula formula --ltl=/tmp/3836/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 199 places, 198 transitions and 706 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3836/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3836/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3836/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3836/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
ltl formula name ParamProductionCell-PT-2-LTLFireability-13
ltl formula formula --ltl=/tmp/3836/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 199 places, 198 transitions and 706 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3836/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3836/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3836/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3836/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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="ParamProductionCell-PT-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ParamProductionCell-PT-2, 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 r265-smll-167863540000380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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