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.r263-smll-167863538200396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ParamProductionCell-PT-4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538200396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 652K
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:16 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 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-4-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678781340959

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-4
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:09:04] [INFO ] Load time of PNML (sax parser for PT used): 108 ms
[2023-03-14 08:09:04] [INFO ] Transformed 231 places.
[2023-03-14 08:09:04] [INFO ] Transformed 202 transitions.
[2023-03-14 08:09:04] [INFO ] Found NUPN structural information;
[2023-03-14 08:09:04] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
FORMULA ParamProductionCell-PT-4-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-4-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 56 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2023-03-14 08:09:04] [INFO ] Computed 59 place invariants in 41 ms
[2023-03-14 08:09:05] [INFO ] Implicit Places using invariants in 909 ms returned [15, 16, 18, 24, 31, 35, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 114, 115, 117, 119, 120, 161, 162, 166, 167, 192, 193, 196, 197, 202, 203, 207, 218]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 971 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/231 places, 198/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1040 ms. Remains : 193/231 places, 198/202 transitions.
Support contains 27 out of 193 places after structural reductions.
[2023-03-14 08:09:06] [INFO ] Flatten gal took : 100 ms
[2023-03-14 08:09:06] [INFO ] Flatten gal took : 40 ms
[2023-03-14 08:09:06] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=17 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 193 cols
[2023-03-14 08:09:07] [INFO ] Computed 25 place invariants in 6 ms
[2023-03-14 08:09:07] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-14 08:09:07] [INFO ] [Real]Absence check using 20 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-14 08:09:07] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1)))))))) U (X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1))))))))&&p2))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 21 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-14 08:09:07] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-14 08:09:07] [INFO ] Implicit Places using invariants in 348 ms returned [16, 81, 82, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 350 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Applied a total of 0 rules in 11 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 382 ms. Remains : 187/193 places, 196/198 transitions.
Stuttering acceptance computed with spot in 821 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p0 p1), (AND p0 (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=5 dest: 7}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 7}, { cond=(NOT p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(AND (EQ s92 1) (EQ s115 1)), p0:(AND (EQ s92 1) (EQ s115 1)), p1:(AND (EQ s81 1) (EQ s84 1) (EQ s107 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 832 reset in 657 ms.
Product exploration explored 100000 steps with 828 reset in 273 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 420 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 10 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 597 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p0 p1), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 196 rows 187 cols
[2023-03-14 08:09:11] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-14 08:09:11] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-14 08:09:11] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-14 08:09:11] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-14 08:09:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2023-03-14 08:09:11] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-14 08:09:11] [INFO ] After 177ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-14 08:09:11] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:11] [INFO ] After 97ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-14 08:09:12] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 8 ms to minimize.
[2023-03-14 08:09:12] [INFO ] Deduced a trap composed of 7 places in 101 ms of which 1 ms to minimize.
[2023-03-14 08:09:12] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-14 08:09:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 389 ms
[2023-03-14 08:09:12] [INFO ] After 553ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-14 08:09:12] [INFO ] After 1024ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 196/196 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 187 transition count 158
Reduce places removed 38 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 78 place count 149 transition count 156
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 147 transition count 156
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 80 place count 147 transition count 144
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 104 place count 135 transition count 144
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 174 place count 100 transition count 109
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 3 with 4 rules applied. Total rules applied 178 place count 98 transition count 107
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 98 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 186 place count 94 transition count 103
Applied a total of 186 rules in 70 ms. Remains 94 /187 variables (removed 93) and now considering 103/196 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 94/187 places, 103/196 transitions.
Finished random walk after 78 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=26 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 635 ms. Reduced automaton from 10 states, 24 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 569 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 506 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
[2023-03-14 08:09:14] [INFO ] Invariant cache hit.
[2023-03-14 08:09:14] [INFO ] [Real]Absence check using 18 positive place invariants in 25 ms returned sat
[2023-03-14 08:09:14] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 8 ms returned sat
[2023-03-14 08:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:14] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2023-03-14 08:09:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:09:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-14 08:09:15] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:15] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2023-03-14 08:09:15] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:15] [INFO ] [Nat]Added 68 Read/Feed constraints in 30 ms returned sat
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 7 places in 108 ms of which 2 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 7 places in 98 ms of which 1 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-14 08:09:15] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 39 places in 130 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-14 08:09:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1013 ms
[2023-03-14 08:09:16] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-14 08:09:17] [INFO ] Added : 179 causal constraints over 36 iterations in 1329 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-14 08:09:17] [INFO ] Invariant cache hit.
[2023-03-14 08:09:17] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-14 08:09:17] [INFO ] Invariant cache hit.
[2023-03-14 08:09:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:18] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
[2023-03-14 08:09:18] [INFO ] Invariant cache hit.
[2023-03-14 08:09:18] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 187/187 places, 196/196 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 372 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 547 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Finished random walk after 2130 steps, including 0 resets, run visited all 4 properties in 19 ms. (steps per millisecond=112 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), true, (X (X (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 689 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 10 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 538 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Stuttering acceptance computed with spot in 555 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
[2023-03-14 08:09:21] [INFO ] Invariant cache hit.
[2023-03-14 08:09:21] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-14 08:09:21] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-14 08:09:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:21] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-14 08:09:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:09:22] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-14 08:09:22] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 6 ms returned sat
[2023-03-14 08:09:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:09:22] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-14 08:09:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:22] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2023-03-14 08:09:22] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2023-03-14 08:09:22] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2023-03-14 08:09:22] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 1 ms to minimize.
[2023-03-14 08:09:22] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 1 ms to minimize.
[2023-03-14 08:09:23] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2023-03-14 08:09:23] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 1 ms to minimize.
[2023-03-14 08:09:23] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:09:23] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-14 08:09:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 923 ms
[2023-03-14 08:09:23] [INFO ] Computed and/alt/rep : 185/325/185 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-14 08:09:24] [INFO ] Added : 179 causal constraints over 36 iterations in 957 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 509 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Product exploration explored 100000 steps with 1431 reset in 268 ms.
Product exploration explored 100000 steps with 1412 reset in 490 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, false, false, true]
Stuttering acceptance computed with spot in 505 ms :[(OR (NOT p2) (AND p0 p1)), (OR (NOT p2) (AND p0 p1)), (AND p0 p1), (AND p0 p1), p1, p1, true, (AND p1 p0), (AND p1 p0), p0]
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 187 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 36 place count 187 transition count 198
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 49 place count 187 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 177 transition count 187
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 177 transition count 187
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 104 place count 177 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 128 place count 153 transition count 163
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 152 place count 153 transition count 163
Deduced a syphon composed of 50 places in 1 ms
Applied a total of 152 rules in 57 ms. Remains 153 /187 variables (removed 34) and now considering 163/196 (removed 33) transitions.
[2023-03-14 08:09:26] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-14 08:09:26] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-14 08:09:26] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/187 places, 163/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 153/187 places, 163/196 transitions.
Support contains 5 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 187 cols
[2023-03-14 08:09:26] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-14 08:09:26] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-14 08:09:26] [INFO ] Invariant cache hit.
[2023-03-14 08:09:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:27] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-14 08:09:27] [INFO ] Invariant cache hit.
[2023-03-14 08:09:27] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 693 ms. Remains : 187/187 places, 196/196 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-00 finished in 19924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 7 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-14 08:09:27] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-14 08:09:27] [INFO ] Implicit Places using invariants in 133 ms returned [16, 81, 82, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 135 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 187/193 places, 196/198 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s81 1) (EQ s106 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 586 reset in 122 ms.
Stack based approach found an accepted trace after 871 steps with 3 reset with depth 370 and stack size 370 in 2 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-05 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 193 transition count 160
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 155 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 76 place count 155 transition count 149
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 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
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 160 place count 113 transition count 118
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 2 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 26 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-14 08:09:27] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-14 08:09:27] [INFO ] Implicit Places using invariants in 122 ms returned [7, 40, 41, 43, 80]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 125 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/193 places, 116/198 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 106 transition count 115
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 105 transition count 115
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 103 transition count 113
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 103 transition count 113
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 42 place count 85 transition count 95
Applied a total of 42 rules in 12 ms. Remains 85 /106 variables (removed 21) and now considering 95/116 (removed 21) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-14 08:09:27] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-14 08:09:28] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-14 08:09:28] [INFO ] Invariant cache hit.
[2023-03-14 08:09:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/193 places, 95/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 426 ms. Remains : 85/193 places, 95/198 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s75 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 127 ms.
Stack based approach found an accepted trace after 138 steps with 0 reset with depth 139 and stack size 139 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-06 finished in 605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 193 transition count 161
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 156 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 155 transition count 160
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 76 place count 155 transition count 149
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 142 transition count 147
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 142 transition count 147
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 3 with 58 rules applied. Total rules applied 160 place count 113 transition count 118
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 3 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 34 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-14 08:09:28] [INFO ] Computed 25 place invariants in 2 ms
[2023-03-14 08:09:28] [INFO ] Implicit Places using invariants in 132 ms returned [42, 44, 81]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 137 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/193 places, 116/198 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 94 transition count 102
Applied a total of 28 rules in 12 ms. Remains 94 /108 variables (removed 14) and now considering 102/116 (removed 14) transitions.
// Phase 1: matrix 102 rows 94 cols
[2023-03-14 08:09:28] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:09:28] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-14 08:09:28] [INFO ] Invariant cache hit.
[2023-03-14 08:09:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:28] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/193 places, 102/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 590 ms. Remains : 94/193 places, 102/198 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s11 1)), p0:(AND (EQ s41 1) (EQ s45 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 177 reset in 221 ms.
Stack based approach found an accepted trace after 99 steps with 0 reset with depth 100 and stack size 100 in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-08 finished in 908 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(G((F(p0)||X(G(p1))))))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 197
Applied a total of 2 rules in 6 ms. Remains 192 /193 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 192 cols
[2023-03-14 08:09:29] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-14 08:09:29] [INFO ] Implicit Places using invariants in 206 ms returned [16, 81, 139]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 207 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/193 places, 197/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 189/193 places, 197/198 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s131 1)), p1:(OR (EQ s80 0) (EQ s103 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16710 reset in 264 ms.
Product exploration explored 100000 steps with 16642 reset in 303 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) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 2982 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=229 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 189 cols
[2023-03-14 08:09:31] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-14 08:09:31] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-14 08:09:31] [INFO ] Invariant cache hit.
[2023-03-14 08:09:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:32] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-14 08:09:32] [INFO ] Invariant cache hit.
[2023-03-14 08:09:32] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 860 ms. Remains : 189/189 places, 197/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 1039 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=148 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16644 reset in 264 ms.
Product exploration explored 100000 steps with 16646 reset in 304 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 197
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 34 place count 189 transition count 199
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 47 place count 189 transition count 199
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 179 transition count 188
Deduced a syphon composed of 37 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 179 transition count 188
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 99 place count 179 transition count 188
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 122 place count 156 transition count 165
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 145 place count 156 transition count 165
Deduced a syphon composed of 46 places in 0 ms
Applied a total of 145 rules in 20 ms. Remains 156 /189 variables (removed 33) and now considering 165/197 (removed 32) transitions.
[2023-03-14 08:09:34] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 165 rows 156 cols
[2023-03-14 08:09:34] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:09:34] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/189 places, 165/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 166 ms. Remains : 156/189 places, 165/197 transitions.
Support contains 4 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 189 /189 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 189 cols
[2023-03-14 08:09:34] [INFO ] Computed 22 place invariants in 5 ms
[2023-03-14 08:09:34] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-14 08:09:34] [INFO ] Invariant cache hit.
[2023-03-14 08:09:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:35] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-14 08:09:35] [INFO ] Invariant cache hit.
[2023-03-14 08:09:35] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 997 ms. Remains : 189/189 places, 197/197 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 6591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||F(p1)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 197
Applied a total of 2 rules in 8 ms. Remains 192 /193 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 192 cols
[2023-03-14 08:09:35] [INFO ] Computed 25 place invariants in 3 ms
[2023-03-14 08:09:36] [INFO ] Implicit Places using invariants in 180 ms returned [16, 82, 84, 139]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 196 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/193 places, 197/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 207 ms. Remains : 188/193 places, 197/198 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s80 1) (EQ s86 1)), p0:(AND (EQ s78 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12 reset in 124 ms.
Stack based approach found an accepted trace after 210 steps with 0 reset with depth 211 and stack size 211 in 0 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-13 finished in 565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1 U p2)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 196
Applied a total of 4 rules in 6 ms. Remains 191 /193 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 191 cols
[2023-03-14 08:09:36] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-14 08:09:36] [INFO ] Implicit Places using invariants in 153 ms returned [16, 81, 84, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 155 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/193 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-14 08:09:36] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:09:36] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-14 08:09:36] [INFO ] Invariant cache hit.
[2023-03-14 08:09:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:09:37] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/193 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 705 ms. Remains : 185/193 places, 194/198 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s6 1) (EQ s115 1)), p1:(AND (EQ s80 1) (EQ s102 1)), p0:(AND (EQ s2 1) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-4-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-4-LTLFireability-14 finished in 952 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(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1)))))))) U (X(X(G((!p0||(X(!p1) U ((X(!p1)&&G(!p0))||X(G(!p1))))))))&&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(X(X(G((F(p0)||X(G(p1))))))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-4-LTLFireability-09
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 193/193 places, 198/198 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 193 transition count 159
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 154 transition count 159
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 78 place count 154 transition count 149
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 98 place count 144 transition count 149
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 143 transition count 148
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 143 transition count 148
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 160 place count 113 transition count 118
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 2 with 4 rules applied. Total rules applied 164 place count 111 transition count 116
Applied a total of 164 rules in 22 ms. Remains 111 /193 variables (removed 82) and now considering 116/198 (removed 82) transitions.
// Phase 1: matrix 116 rows 111 cols
[2023-03-14 08:09:37] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-14 08:09:38] [INFO ] Implicit Places using invariants in 201 ms returned [7, 40, 81]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 202 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/193 places, 116/198 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 108 transition count 115
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 107 transition count 115
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 6 place count 105 transition count 113
Applied a total of 6 rules in 8 ms. Remains 105 /108 variables (removed 3) and now considering 113/116 (removed 3) transitions.
// Phase 1: matrix 113 rows 105 cols
[2023-03-14 08:09:38] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:09:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-14 08:09:38] [INFO ] Invariant cache hit.
[2023-03-14 08:09:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:38] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 105/193 places, 113/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 705 ms. Remains : 105/193 places, 113/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-4-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s40 1) (EQ s73 1)), p1:(OR (EQ s38 0) (EQ s55 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 16633 reset in 145 ms.
Product exploration explored 100000 steps with 16708 reset in 298 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) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 261 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=130 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 399 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-14 08:09:40] [INFO ] Invariant cache hit.
[2023-03-14 08:09:40] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-14 08:09:40] [INFO ] Invariant cache hit.
[2023-03-14 08:09:40] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:40] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-14 08:09:40] [INFO ] Invariant cache hit.
[2023-03-14 08:09:40] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 105/105 places, 113/113 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Finished random walk after 183 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=91 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 291 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 276 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 16700 reset in 226 ms.
Product exploration explored 100000 steps with 16713 reset in 265 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-14 08:09:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-14 08:09:43] [INFO ] Invariant cache hit.
[2023-03-14 08:09:43] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 105/105 places, 113/113 transitions.
Support contains 4 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 113/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2023-03-14 08:09:43] [INFO ] Invariant cache hit.
[2023-03-14 08:09:43] [INFO ] Implicit Places using invariants in 176 ms returned []
[2023-03-14 08:09:43] [INFO ] Invariant cache hit.
[2023-03-14 08:09:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-14 08:09:44] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2023-03-14 08:09:44] [INFO ] Invariant cache hit.
[2023-03-14 08:09:44] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 677 ms. Remains : 105/105 places, 113/113 transitions.
Treatment of property ParamProductionCell-PT-4-LTLFireability-09 finished in 6727 ms.
[2023-03-14 08:09:44] [INFO ] Flatten gal took : 26 ms
[2023-03-14 08:09:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-14 08:09:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 198 transitions and 668 arcs took 4 ms.
Total runtime 39982 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-4
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA ParamProductionCell-PT-4-LTLFireability-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ParamProductionCell-PT-4-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678781386600

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 ParamProductionCell-PT-4-LTLFireability-09
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for ParamProductionCell-PT-4-LTLFireability-09
lola: result : false
lola: markings : 267
lola: fired transitions : 267
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-4-LTLFireability-00
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-4-LTLFireability-00
lola: result : false
lola: markings : 2917
lola: fired transitions : 3267
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-4-LTLFireability-00: LTL false LTL model checker
ParamProductionCell-PT-4-LTLFireability-09: LTL false LTL model checker


Time elapsed: 1 secs. Pages in use: 1

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-4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ParamProductionCell-PT-4, 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 r263-smll-167863538200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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