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-167863539900372.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-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539900372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 7.6K Feb 26 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 20K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 185K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 26 17:16 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-1-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678988397686

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-1
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 17:40:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 17:40:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 17:40:01] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2023-03-16 17:40:01] [INFO ] Transformed 231 places.
[2023-03-16 17:40:01] [INFO ] Transformed 202 transitions.
[2023-03-16 17:40:01] [INFO ] Found NUPN structural information;
[2023-03-16 17:40:01] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 341 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 80 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2023-03-16 17:40:01] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-16 17:40:02] [INFO ] Implicit Places using invariants in 798 ms returned [1, 15, 16, 18, 19, 24, 31, 35, 47, 59, 64, 65, 73, 78, 79, 101, 114, 119, 120, 160, 166, 189, 191, 192, 196, 201, 202, 206]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 856 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 197/202 transitions.
Applied a total of 0 rules in 20 ms. Remains 198 /198 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 957 ms. Remains : 198/231 places, 197/202 transitions.
Support contains 51 out of 198 places after structural reductions.
[2023-03-16 17:40:03] [INFO ] Flatten gal took : 93 ms
[2023-03-16 17:40:03] [INFO ] Flatten gal took : 39 ms
[2023-03-16 17:40:03] [INFO ] Input system was already deterministic with 197 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 883 ms. (steps per millisecond=11 ) properties (out of 30) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 251 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 197 rows 198 cols
[2023-03-16 17:40:05] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-16 17:40:05] [INFO ] [Real]Absence check using 22 positive place invariants in 29 ms returned sat
[2023-03-16 17:40:05] [INFO ] [Real]Absence check using 22 positive and 9 generalized place invariants in 8 ms returned sat
[2023-03-16 17:40:06] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-16 17:40:06] [INFO ] [Nat]Absence check using 22 positive place invariants in 19 ms returned sat
[2023-03-16 17:40:06] [INFO ] [Nat]Absence check using 22 positive and 9 generalized place invariants in 7 ms returned sat
[2023-03-16 17:40:06] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-16 17:40:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:06] [INFO ] After 139ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-16 17:40:06] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 8 ms to minimize.
[2023-03-16 17:40:06] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 1 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 2 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 7 places in 119 ms of which 1 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 0 ms to minimize.
[2023-03-16 17:40:07] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 0 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1361 ms
[2023-03-16 17:40:08] [INFO ] Deduced a trap composed of 35 places in 133 ms of which 1 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 305 ms
[2023-03-16 17:40:08] [INFO ] Deduced a trap composed of 26 places in 166 ms of which 1 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 2 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Deduced a trap composed of 41 places in 135 ms of which 1 ms to minimize.
[2023-03-16 17:40:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 484 ms
[2023-03-16 17:40:08] [INFO ] After 2347ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :0
[2023-03-16 17:40:08] [INFO ] After 2811ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-1-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-1-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-1-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA ParamProductionCell-PT-1-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(F(p0))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 138 place count 129 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 128 transition count 127
Applied a total of 140 rules in 87 ms. Remains 128 /198 variables (removed 70) and now considering 127/197 (removed 70) transitions.
// Phase 1: matrix 127 rows 128 cols
[2023-03-16 17:40:09] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-16 17:40:09] [INFO ] Implicit Places using invariants in 292 ms returned [0, 4, 7, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 89, 92, 113, 122]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 295 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/198 places, 127/197 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 111 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 109 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 109 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 105 transition count 121
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 72 place count 75 transition count 91
Applied a total of 72 rules in 26 ms. Remains 75 /111 variables (removed 36) and now considering 91/127 (removed 36) transitions.
// Phase 1: matrix 91 rows 75 cols
[2023-03-16 17:40:09] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-16 17:40:09] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-16 17:40:09] [INFO ] Invariant cache hit.
[2023-03-16 17:40:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:10] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/198 places, 91/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 809 ms. Remains : 75/198 places, 91/197 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s50 1) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3333 reset in 653 ms.
Product exploration explored 100000 steps with 3333 reset in 366 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
[2023-03-16 17:40:12] [INFO ] Invariant cache hit.
[2023-03-16 17:40:12] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-16 17:40:12] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 17:40:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:12] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-16 17:40:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 17:40:12] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-16 17:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:12] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-16 17:40:12] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:12] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2023-03-16 17:40:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 439 ms
[2023-03-16 17:40:12] [INFO ] Computed and/alt/rep : 90/220/90 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 17:40:13] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2023-03-16 17:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-16 17:40:13] [INFO ] Added : 83 causal constraints over 18 iterations in 412 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 91/91 transitions.
Applied a total of 0 rules in 6 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 17:40:13] [INFO ] Invariant cache hit.
[2023-03-16 17:40:13] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-16 17:40:13] [INFO ] Invariant cache hit.
[2023-03-16 17:40:13] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:13] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-16 17:40:13] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 17:40:13] [INFO ] Invariant cache hit.
[2023-03-16 17:40:13] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 75/75 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 209 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-16 17:40:14] [INFO ] Invariant cache hit.
[2023-03-16 17:40:14] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-16 17:40:14] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 17:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:14] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-16 17:40:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-16 17:40:14] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 17:40:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:14] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-16 17:40:14] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:14] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 464 ms
[2023-03-16 17:40:15] [INFO ] Computed and/alt/rep : 90/220/90 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-16 17:40:15] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2023-03-16 17:40:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-16 17:40:15] [INFO ] Added : 83 causal constraints over 18 iterations in 423 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3333 reset in 181 ms.
Product exploration explored 100000 steps with 3333 reset in 127 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 91/91 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 17:40:16] [INFO ] Invariant cache hit.
[2023-03-16 17:40:16] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-16 17:40:16] [INFO ] Invariant cache hit.
[2023-03-16 17:40:16] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:16] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-16 17:40:16] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:40:16] [INFO ] Invariant cache hit.
[2023-03-16 17:40:16] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 75/75 places, 91/91 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-00 finished in 7401 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(p0))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 10 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:40:16] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-16 17:40:17] [INFO ] Implicit Places using invariants in 178 ms returned [28, 33, 34, 38, 83, 84, 97, 99, 140, 142, 144, 188]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 182 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 10 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2023-03-16 17:40:17] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-16 17:40:17] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-16 17:40:17] [INFO ] Invariant cache hit.
[2023-03-16 17:40:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:17] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 704 ms. Remains : 183/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (EQ s157 1) (EQ s171 1) (EQ s182 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 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-01 finished in 1111 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 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 138 place count 129 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 128 transition count 127
Applied a total of 140 rules in 34 ms. Remains 128 /198 variables (removed 70) and now considering 127/197 (removed 70) transitions.
// Phase 1: matrix 127 rows 128 cols
[2023-03-16 17:40:17] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:40:17] [INFO ] Implicit Places using invariants in 145 ms returned [0, 4, 7, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 89, 90, 92, 113, 122]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 148 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 110/198 places, 127/197 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 110 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 108 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 108 transition count 121
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 104 transition count 121
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 78 place count 71 transition count 88
Applied a total of 78 rules in 26 ms. Remains 71 /110 variables (removed 39) and now considering 88/127 (removed 39) transitions.
// Phase 1: matrix 88 rows 71 cols
[2023-03-16 17:40:18] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-16 17:40:18] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-16 17:40:18] [INFO ] Invariant cache hit.
[2023-03-16 17:40:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:18] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 71/198 places, 88/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 440 ms. Remains : 71/198 places, 88/197 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-02 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:(AND (EQ s27 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1799 reset in 238 ms.
Product exploration explored 100000 steps with 1800 reset in 139 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 142 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 95 ms :[(NOT p0), (NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 146 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 106 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0)]
[2023-03-16 17:40:19] [INFO ] Invariant cache hit.
[2023-03-16 17:40:19] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-16 17:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:19] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-16 17:40:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 17:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:19] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-16 17:40:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:19] [INFO ] [Nat]Added 67 Read/Feed constraints in 8 ms returned sat
[2023-03-16 17:40:19] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 6 ms to minimize.
[2023-03-16 17:40:19] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 59 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2023-03-16 17:40:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 732 ms
[2023-03-16 17:40:20] [INFO ] Computed and/alt/rep : 87/209/87 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 17:40:20] [INFO ] Added : 84 causal constraints over 17 iterations in 274 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-16 17:40:20] [INFO ] Invariant cache hit.
[2023-03-16 17:40:20] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-16 17:40:20] [INFO ] Invariant cache hit.
[2023-03-16 17:40:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-16 17:40:21] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 17:40:21] [INFO ] Invariant cache hit.
[2023-03-16 17:40:21] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 71/71 places, 88/88 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 144 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 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 55 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=55 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 165 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
[2023-03-16 17:40:21] [INFO ] Invariant cache hit.
[2023-03-16 17:40:21] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-16 17:40:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:21] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-16 17:40:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-16 17:40:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:22] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-16 17:40:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:22] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 1 ms to minimize.
[2023-03-16 17:40:22] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 418 ms
[2023-03-16 17:40:22] [INFO ] Computed and/alt/rep : 87/209/87 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-16 17:40:22] [INFO ] Added : 84 causal constraints over 17 iterations in 174 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1799 reset in 114 ms.
Product exploration explored 100000 steps with 1798 reset in 126 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 71/71 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-16 17:40:23] [INFO ] Invariant cache hit.
[2023-03-16 17:40:23] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-16 17:40:23] [INFO ] Invariant cache hit.
[2023-03-16 17:40:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:23] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-03-16 17:40:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:40:23] [INFO ] Invariant cache hit.
[2023-03-16 17:40:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 71/71 places, 88/88 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-02 finished in 5746 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 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 198 transition count 173
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 174 transition count 173
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 48 place count 174 transition count 161
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 134 place count 131 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 130 transition count 129
Applied a total of 136 rules in 44 ms. Remains 130 /198 variables (removed 68) and now considering 129/197 (removed 68) transitions.
// Phase 1: matrix 129 rows 130 cols
[2023-03-16 17:40:23] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:40:23] [INFO ] Implicit Places using invariants in 152 ms returned [0, 4, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 90, 91, 93, 115, 124]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 155 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/198 places, 129/197 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 113 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 110 transition count 126
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 70 place count 78 transition count 94
Applied a total of 70 rules in 11 ms. Remains 78 /113 variables (removed 35) and now considering 94/129 (removed 35) transitions.
// Phase 1: matrix 94 rows 78 cols
[2023-03-16 17:40:23] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 17:40:23] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-16 17:40:23] [INFO ] Invariant cache hit.
[2023-03-16 17:40:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:23] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/198 places, 94/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 443 ms. Remains : 78/198 places, 94/197 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s66 1) (NEQ s72 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1299 reset in 169 ms.
Product exploration explored 100000 steps with 1270 reset in 605 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 182 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 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 237 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 110 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 94/94 transitions.
Applied a total of 0 rules in 6 ms. Remains 78 /78 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-16 17:40:25] [INFO ] Invariant cache hit.
[2023-03-16 17:40:25] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-16 17:40:25] [INFO ] Invariant cache hit.
[2023-03-16 17:40:25] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:26] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2023-03-16 17:40:26] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-16 17:40:26] [INFO ] Invariant cache hit.
[2023-03-16 17:40:26] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 520 ms. Remains : 78/78 places, 94/94 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 168 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 104 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 200 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 371 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1294 reset in 178 ms.
Product exploration explored 100000 steps with 1287 reset in 204 ms.
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-16 17:40:27] [INFO ] Invariant cache hit.
[2023-03-16 17:40:27] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-16 17:40:27] [INFO ] Invariant cache hit.
[2023-03-16 17:40:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:28] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2023-03-16 17:40:28] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 17:40:28] [INFO ] Invariant cache hit.
[2023-03-16 17:40:28] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 573 ms. Remains : 78/78 places, 94/94 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-03 finished in 4695 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)) U (G(p1)||F(p2))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 8 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:40:28] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-16 17:40:28] [INFO ] Implicit Places using invariants in 305 ms returned [28, 33, 38, 83, 84, 97, 99, 142, 170, 188]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 308 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/197 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 8 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:40:28] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 17:40:28] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-16 17:40:28] [INFO ] Invariant cache hit.
[2023-03-16 17:40:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:29] [INFO ] Implicit Places using invariants and state equation in 556 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1068 ms. Remains : 185/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s135 1) (EQ s151 1)), p2:(AND (EQ s29 1) (EQ s32 1)), p0:(AND (EQ s132 1) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1388 reset in 207 ms.
Product exploration explored 100000 steps with 1389 reset in 222 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 (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 1004 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) p0), false, (NOT p2)]
Finished random walk after 91 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=30 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1)), (F (OR p0 p1)), (F p0)]
Knowledge based reduction with 15 factoid took 1283 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p2), (NOT p2)]
[2023-03-16 17:40:32] [INFO ] Invariant cache hit.
[2023-03-16 17:40:33] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-16 17:40:33] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-16 17:40:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:33] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-16 17:40:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-16 17:40:33] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 17:40:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:33] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2023-03-16 17:40:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:33] [INFO ] [Nat]Added 68 Read/Feed constraints in 40 ms returned sat
[2023-03-16 17:40:33] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-16 17:40:33] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 0 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 0 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
[2023-03-16 17:40:34] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2023-03-16 17:40:35] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2023-03-16 17:40:35] [INFO ] Deduced a trap composed of 51 places in 52 ms of which 1 ms to minimize.
[2023-03-16 17:40:35] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 0 ms to minimize.
[2023-03-16 17:40:35] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2023-03-16 17:40:35] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1503 ms
[2023-03-16 17:40:35] [INFO ] Computed and/alt/rep : 193/309/193 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-16 17:40:36] [INFO ] Added : 182 causal constraints over 37 iterations in 838 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 185 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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:40:36] [INFO ] Invariant cache hit.
[2023-03-16 17:40:36] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-16 17:40:36] [INFO ] Invariant cache hit.
[2023-03-16 17:40:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:36] [INFO ] Implicit Places using invariants and state equation in 375 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-16 17:40:36] [INFO ] Invariant cache hit.
[2023-03-16 17:40:36] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 760 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 : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p2)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=70 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p2)]
[2023-03-16 17:40:37] [INFO ] Invariant cache hit.
[2023-03-16 17:40:37] [INFO ] [Real]Absence check using 20 positive place invariants in 19 ms returned sat
[2023-03-16 17:40:37] [INFO ] [Real]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 17:40:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:37] [INFO ] [Real]Absence check using state equation in 314 ms returned sat
[2023-03-16 17:40:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 17 ms returned sat
[2023-03-16 17:40:38] [INFO ] [Nat]Absence check using 20 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-16 17:40:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:38] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-16 17:40:38] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:38] [INFO ] [Nat]Added 68 Read/Feed constraints in 45 ms returned sat
[2023-03-16 17:40:38] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-16 17:40:38] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 1 ms to minimize.
[2023-03-16 17:40:38] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2023-03-16 17:40:38] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 0 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 1 ms to minimize.
[2023-03-16 17:40:39] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 1 ms to minimize.
[2023-03-16 17:40:40] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 1 ms to minimize.
[2023-03-16 17:40:40] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2023-03-16 17:40:40] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2023-03-16 17:40:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-16 17:40:40] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2011 ms
[2023-03-16 17:40:40] [INFO ] Computed and/alt/rep : 193/309/193 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-16 17:40:41] [INFO ] Added : 182 causal constraints over 37 iterations in 1207 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 55 ms :[(NOT p2)]
Product exploration explored 100000 steps with 1387 reset in 191 ms.
Product exploration explored 100000 steps with 1389 reset in 226 ms.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 185 transition count 161
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 152 transition count 161
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 66 place count 152 transition count 149
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 90 place count 140 transition count 149
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 2 with 94 rules applied. Total rules applied 184 place count 93 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 186 place count 92 transition count 101
Applied a total of 186 rules in 29 ms. Remains 92 /185 variables (removed 93) and now considering 101/194 (removed 93) transitions.
// Phase 1: matrix 101 rows 92 cols
[2023-03-16 17:40:42] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 17:40:42] [INFO ] Implicit Places using invariants in 194 ms returned [0, 3, 6, 35, 56, 65, 67]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 196 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/185 places, 101/194 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 85 transition count 97
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 81 transition count 97
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 76 transition count 92
Applied a total of 18 rules in 10 ms. Remains 76 /85 variables (removed 9) and now considering 92/101 (removed 9) transitions.
// Phase 1: matrix 92 rows 76 cols
[2023-03-16 17:40:42] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 17:40:42] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-16 17:40:42] [INFO ] Invariant cache hit.
[2023-03-16 17:40:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:42] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/185 places, 92/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 617 ms. Remains : 76/185 places, 92/194 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-04 finished in 14499 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||F((G(p1)||X(p2))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 50 place count 173 transition count 161
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 72 place count 162 transition count 161
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 161 transition count 160
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 161 transition count 160
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 138 place count 129 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 128 transition count 127
Applied a total of 140 rules in 31 ms. Remains 128 /198 variables (removed 70) and now considering 127/197 (removed 70) transitions.
// Phase 1: matrix 127 rows 128 cols
[2023-03-16 17:40:42] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:40:43] [INFO ] Implicit Places using invariants in 283 ms returned [0, 4, 7, 15, 19, 22, 39, 45, 46, 58, 77, 89, 90, 92, 113, 122]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 286 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 112/198 places, 127/197 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 112 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 110 transition count 125
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 110 transition count 121
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 106 transition count 121
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 64 place count 80 transition count 95
Applied a total of 64 rules in 19 ms. Remains 80 /112 variables (removed 32) and now considering 95/127 (removed 32) transitions.
// Phase 1: matrix 95 rows 80 cols
[2023-03-16 17:40:43] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-16 17:40:43] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-16 17:40:43] [INFO ] Invariant cache hit.
[2023-03-16 17:40:43] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:43] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/198 places, 95/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 748 ms. Remains : 80/198 places, 95/197 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s42 1) (EQ s44 1)), p1:(AND (EQ s13 1) (EQ s21 1)), p2:(OR (EQ s42 0) (EQ s44 0))], 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 33272 reset in 210 ms.
Product exploration explored 100000 steps with 33282 reset in 235 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 p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 17:40:44] [INFO ] Invariant cache hit.
[2023-03-16 17:40:44] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 17:40:44] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-16 17:40:44] [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 (NOT p0) (NOT p1) p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 328 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 2 out of 80 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-16 17:40:45] [INFO ] Invariant cache hit.
[2023-03-16 17:40:45] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-16 17:40:45] [INFO ] Invariant cache hit.
[2023-03-16 17:40:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:45] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-16 17:40:45] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 17:40:45] [INFO ] Invariant cache hit.
[2023-03-16 17:40:45] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 550 ms. Remains : 80/80 places, 95/95 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) p2), (X p2), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 154 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 66 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND (NOT p0) p2), (X p2), (X (X p2))]
False Knowledge obtained : [(F p0), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 33547 reset in 122 ms.
Product exploration explored 100000 steps with 33219 reset in 132 ms.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 95/95 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 78 transition count 93
Applied a total of 4 rules in 4 ms. Remains 78 /80 variables (removed 2) and now considering 93/95 (removed 2) transitions.
// Phase 1: matrix 93 rows 78 cols
[2023-03-16 17:40:46] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-16 17:40:46] [INFO ] Implicit Places using invariants in 90 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 77/80 places, 93/95 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 75 transition count 91
Applied a total of 4 rules in 4 ms. Remains 75 /77 variables (removed 2) and now considering 91/93 (removed 2) transitions.
// Phase 1: matrix 91 rows 75 cols
[2023-03-16 17:40:46] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-16 17:40:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-16 17:40:46] [INFO ] Invariant cache hit.
[2023-03-16 17:40:46] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:46] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/80 places, 91/95 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 373 ms. Remains : 75/80 places, 91/95 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-06 finished in 4164 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)||(!p0&&F(G(p1))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 4 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:40:46] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:40:47] [INFO ] Implicit Places using invariants in 262 ms returned [28, 33, 34, 38, 83, 84, 97, 99, 140, 142, 144, 170, 188]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 264 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 10 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2023-03-16 17:40:47] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-16 17:40:47] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-16 17:40:47] [INFO ] Invariant cache hit.
[2023-03-16 17:40:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:47] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 932 ms. Remains : 182/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 233 ms :[p0, p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s13 1) (EQ s73 1)), p1:(NEQ s121 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 292 steps with 0 reset with depth 293 and stack size 293 in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-07 finished in 1301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 196
Applied a total of 2 rules in 4 ms. Remains 197 /198 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 197 cols
[2023-03-16 17:40:48] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:40:48] [INFO ] Implicit Places using invariants in 188 ms returned [28, 33, 34, 38, 83, 84, 97, 99, 142, 144, 170]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 190 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 4 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-16 17:40:48] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:40:48] [INFO ] Implicit Places using invariants in 167 ms returned []
[2023-03-16 17:40:48] [INFO ] Invariant cache hit.
[2023-03-16 17:40:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:49] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/197 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 937 ms. Remains : 184/198 places, 194/197 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s175 1) (EQ s180 1)), p1:(AND (EQ s131 1) (EQ s150 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 7142 reset in 320 ms.
Product exploration explored 100000 steps with 7142 reset in 283 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 p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 203 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 17:40:50] [INFO ] Invariant cache hit.
[2023-03-16 17:40:51] [INFO ] [Real]Absence check using 20 positive place invariants in 22 ms returned sat
[2023-03-16 17:40:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:51] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2023-03-16 17:40:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-16 17:40:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:52] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-16 17:40:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:52] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2023-03-16 17:40:52] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-16 17:40:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2023-03-16 17:40:52] [INFO ] Computed and/alt/rep : 193/310/193 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-16 17:40:52] [INFO ] Added : 11 causal constraints over 3 iterations in 166 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-16 17:40:52] [INFO ] Invariant cache hit.
[2023-03-16 17:40:52] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-16 17:40:52] [INFO ] Invariant cache hit.
[2023-03-16 17:40:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:53] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-16 17:40:53] [INFO ] Invariant cache hit.
[2023-03-16 17:40:53] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 940 ms. Remains : 184/184 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 p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 151 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 17:40:54] [INFO ] Invariant cache hit.
[2023-03-16 17:40:54] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2023-03-16 17:40:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:54] [INFO ] [Real]Absence check using state equation in 608 ms returned sat
[2023-03-16 17:40:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:40:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 20 ms returned sat
[2023-03-16 17:40:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:40:55] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2023-03-16 17:40:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:55] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2023-03-16 17:40:55] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 1 ms to minimize.
[2023-03-16 17:40:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-16 17:40:55] [INFO ] Computed and/alt/rep : 193/310/193 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-16 17:40:55] [INFO ] Added : 11 causal constraints over 3 iterations in 222 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7142 reset in 231 ms.
Product exploration explored 100000 steps with 7142 reset in 265 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 184 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 32 place count 184 transition count 194
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 45 place count 184 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 53 place count 176 transition count 186
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 61 place count 176 transition count 186
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 104 place count 176 transition count 186
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 127 place count 153 transition count 163
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 150 place count 153 transition count 163
Deduced a syphon composed of 57 places in 1 ms
Applied a total of 150 rules in 39 ms. Remains 153 /184 variables (removed 31) and now considering 163/194 (removed 31) transitions.
[2023-03-16 17:40:56] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-16 17:40:56] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-16 17:40:57] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/184 places, 163/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 153/184 places, 163/194 transitions.
Support contains 4 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-16 17:40:57] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 17:40:57] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-16 17:40:57] [INFO ] Invariant cache hit.
[2023-03-16 17:40:57] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 17:40:57] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-16 17:40:57] [INFO ] Invariant cache hit.
[2023-03-16 17:40:57] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 184/184 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-13 finished in 9726 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))'
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' '!(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(p0)) U (G(p1)||F(p2))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-1-LTLFireability-04
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p1) p0)]
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 172
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 172
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 50 place count 173 transition count 163
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 68 place count 164 transition count 163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 163 transition count 162
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 163 transition count 162
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 128 place count 134 transition count 133
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 133 transition count 132
Applied a total of 130 rules in 20 ms. Remains 133 /198 variables (removed 65) and now considering 132/197 (removed 65) transitions.
// Phase 1: matrix 132 rows 133 cols
[2023-03-16 17:40:58] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-16 17:40:59] [INFO ] Implicit Places using invariants in 191 ms returned [0, 4, 7, 15, 19, 23, 40, 46, 47, 59, 61, 78, 92, 118, 127]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 197 ms to find 15 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 118/198 places, 132/197 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 118 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 116 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 116 transition count 126
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 112 transition count 126
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 60 place count 88 transition count 102
Applied a total of 60 rules in 10 ms. Remains 88 /118 variables (removed 30) and now considering 102/132 (removed 30) transitions.
// Phase 1: matrix 102 rows 88 cols
[2023-03-16 17:40:59] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-16 17:40:59] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-16 17:40:59] [INFO ] Invariant cache hit.
[2023-03-16 17:40:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:40:59] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 88/198 places, 102/197 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 546 ms. Remains : 88/198 places, 102/197 transitions.
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s60 1) (EQ s70 1)), p2:(AND (EQ s11 1) (EQ s14 1)), p0:(AND (EQ s57 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2633 reset in 109 ms.
Product exploration explored 100000 steps with 2634 reset in 120 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 (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 986 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) p0), false, (NOT p2)]
Finished random walk after 49 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=49 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p1)), (F (OR p0 p1)), (F p0)]
Knowledge based reduction with 15 factoid took 666 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p2)]
[2023-03-16 17:41:01] [INFO ] Invariant cache hit.
[2023-03-16 17:41:01] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-16 17:41:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:01] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-16 17:41:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:41:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-16 17:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:01] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-16 17:41:01] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:01] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:41:01] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-16 17:41:02] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 829 ms
[2023-03-16 17:41:02] [INFO ] Computed and/alt/rep : 101/220/101 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 17:41:02] [INFO ] Added : 84 causal constraints over 17 iterations in 190 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-16 17:41:02] [INFO ] Invariant cache hit.
[2023-03-16 17:41:03] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-16 17:41:03] [INFO ] Invariant cache hit.
[2023-03-16 17:41:03] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:03] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-16 17:41:03] [INFO ] Invariant cache hit.
[2023-03-16 17:41:03] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 88/88 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p2)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=36 )
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p2)]
[2023-03-16 17:41:03] [INFO ] Invariant cache hit.
[2023-03-16 17:41:03] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-16 17:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:04] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-16 17:41:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:41:04] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2023-03-16 17:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:04] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-16 17:41:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:04] [INFO ] [Nat]Added 67 Read/Feed constraints in 26 ms returned sat
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-16 17:41:04] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-16 17:41:05] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 1216 ms
[2023-03-16 17:41:05] [INFO ] Computed and/alt/rep : 101/220/101 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-16 17:41:05] [INFO ] Added : 84 causal constraints over 17 iterations in 296 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 51 ms :[(NOT p2)]
Product exploration explored 100000 steps with 2635 reset in 176 ms.
Product exploration explored 100000 steps with 2633 reset in 204 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 102/102 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 88 transition count 101
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 87 transition count 101
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 12 place count 82 transition count 96
Applied a total of 12 rules in 18 ms. Remains 82 /88 variables (removed 6) and now considering 96/102 (removed 6) transitions.
// Phase 1: matrix 96 rows 82 cols
[2023-03-16 17:41:06] [INFO ] Computed 16 place invariants in 0 ms
[2023-03-16 17:41:06] [INFO ] Implicit Places using invariants in 149 ms returned [57, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 150 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/88 places, 96/102 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 76 transition count 92
Applied a total of 8 rules in 5 ms. Remains 76 /80 variables (removed 4) and now considering 92/96 (removed 4) transitions.
// Phase 1: matrix 92 rows 76 cols
[2023-03-16 17:41:06] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-16 17:41:06] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-16 17:41:06] [INFO ] Invariant cache hit.
[2023-03-16 17:41:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:06] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/88 places, 92/102 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 581 ms. Remains : 76/88 places, 92/102 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-04 finished in 8306 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||F((G(p1)||X(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p1)))))'
Found a Shortening insensitive property : ParamProductionCell-PT-1-LTLFireability-13
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 198/198 places, 197/197 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 198 transition count 174
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 24 rules applied. Total rules applied 47 place count 175 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 174 transition count 173
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 48 place count 174 transition count 163
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 68 place count 164 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 163 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 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 130 place count 133 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 132 transition count 131
Applied a total of 132 rules in 25 ms. Remains 132 /198 variables (removed 66) and now considering 131/197 (removed 66) transitions.
// Phase 1: matrix 131 rows 132 cols
[2023-03-16 17:41:07] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-16 17:41:07] [INFO ] Implicit Places using invariants in 242 ms returned [0, 4, 7, 15, 18, 19, 22, 39, 45, 46, 58, 60, 77, 90, 92, 116]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 254 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 116/198 places, 131/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 116 transition count 130
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 115 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 114 transition count 129
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 4 place count 114 transition count 124
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 14 place count 109 transition count 124
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 3 with 52 rules applied. Total rules applied 66 place count 83 transition count 98
Applied a total of 66 rules in 12 ms. Remains 83 /116 variables (removed 33) and now considering 98/131 (removed 33) transitions.
// Phase 1: matrix 98 rows 83 cols
[2023-03-16 17:41:07] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-16 17:41:07] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-16 17:41:07] [INFO ] Invariant cache hit.
[2023-03-16 17:41:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:07] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 83/198 places, 98/197 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 699 ms. Remains : 83/198 places, 98/197 transitions.
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s77 1) (EQ s79 1)), p1:(AND (EQ s51 1) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12500 reset in 194 ms.
Product exploration explored 100000 steps with 12500 reset in 221 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 p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 317 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 207 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 17:41:09] [INFO ] Invariant cache hit.
[2023-03-16 17:41:09] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-16 17:41:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:09] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-16 17:41:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:41:09] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-16 17:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:09] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-16 17:41:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:09] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-16 17:41:09] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-16 17:41:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-16 17:41:09] [INFO ] Computed and/alt/rep : 97/217/97 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-16 17:41:09] [INFO ] Added : 5 causal constraints over 1 iterations in 45 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 83 /83 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 17:41:09] [INFO ] Invariant cache hit.
[2023-03-16 17:41:10] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-16 17:41:10] [INFO ] Invariant cache hit.
[2023-03-16 17:41:10] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:10] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2023-03-16 17:41:10] [INFO ] Invariant cache hit.
[2023-03-16 17:41:10] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 83/83 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-16 17:41:11] [INFO ] Invariant cache hit.
[2023-03-16 17:41:11] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-16 17:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:11] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-16 17:41:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 17:41:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-16 17:41:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 17:41:11] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-16 17:41:11] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:11] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2023-03-16 17:41:11] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-16 17:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-16 17:41:11] [INFO ] Computed and/alt/rep : 97/217/97 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-16 17:41:11] [INFO ] Added : 5 causal constraints over 1 iterations in 44 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 12500 reset in 194 ms.
Product exploration explored 100000 steps with 12500 reset in 220 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 17:41:12] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 17:41:12] [INFO ] Invariant cache hit.
[2023-03-16 17:41:12] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 83/83 places, 98/98 transitions.
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 17:41:12] [INFO ] Invariant cache hit.
[2023-03-16 17:41:12] [INFO ] Implicit Places using invariants in 135 ms returned []
[2023-03-16 17:41:12] [INFO ] Invariant cache hit.
[2023-03-16 17:41:13] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 17:41:13] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2023-03-16 17:41:13] [INFO ] Invariant cache hit.
[2023-03-16 17:41:13] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 521 ms. Remains : 83/83 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-1-LTLFireability-13 finished in 6403 ms.
[2023-03-16 17:41:13] [INFO ] Flatten gal took : 27 ms
[2023-03-16 17:41:13] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 17:41:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 197 transitions and 688 arcs took 7 ms.
Total runtime 72586 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2453/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2453/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2453/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2453/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2453/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2453/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-1-LTLFireability-00
Could not compute solution for formula : ParamProductionCell-PT-1-LTLFireability-02
Could not compute solution for formula : ParamProductionCell-PT-1-LTLFireability-03
Could not compute solution for formula : ParamProductionCell-PT-1-LTLFireability-04
Could not compute solution for formula : ParamProductionCell-PT-1-LTLFireability-06
Could not compute solution for formula : ParamProductionCell-PT-1-LTLFireability-13

BK_STOP 1678988475893

--------------------
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-1-LTLFireability-00
ltl formula formula --ltl=/tmp/2453/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 198 places, 197 transitions and 688 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.090 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2453/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2453/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2453/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2453/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 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-1-LTLFireability-02
ltl formula formula --ltl=/tmp/2453/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
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 198 places, 197 transitions and 688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2453/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2453/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2453/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2453/ltl_1_
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
double free or corruption (fasttop)
ltl formula name ParamProductionCell-PT-1-LTLFireability-03
ltl formula formula --ltl=/tmp/2453/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
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 198 places, 197 transitions and 688 arcs
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.080 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2453/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2453/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2453/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2453/ltl_2_
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:
ltl formula name ParamProductionCell-PT-1-LTLFireability-04
ltl formula formula --ltl=/tmp/2453/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 198 places, 197 transitions and 688 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2453/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2453/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2453/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.090 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2453/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ParamProductionCell-PT-1-LTLFireability-06
ltl formula formula --ltl=/tmp/2453/ltl_4_
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 198 places, 197 transitions and 688 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.040 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2453/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2453/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2453/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2453/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 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:
ltl formula name ParamProductionCell-PT-1-LTLFireability-13
ltl formula formula --ltl=/tmp/2453/ltl_5_
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 198 places, 197 transitions and 688 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.030 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2453/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2453/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2453/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2453/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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-1"
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-1, 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-167863539900372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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