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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 616K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.8K 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 9.9K Feb 26 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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-3-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-3-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678780991120

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-3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:03:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:03:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:03:13] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2023-03-14 08:03:13] [INFO ] Transformed 231 places.
[2023-03-14 08:03:13] [INFO ] Transformed 202 transitions.
[2023-03-14 08:03:13] [INFO ] Found NUPN structural information;
[2023-03-14 08:03:13] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 413 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-3-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 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 49 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:03:14] [INFO ] Computed 59 place invariants in 25 ms
[2023-03-14 08:03:14] [INFO ] Implicit Places using invariants in 510 ms returned [15, 16, 24, 35, 36, 42, 59, 64, 65, 73, 79, 99, 114, 119, 120, 161, 162, 164, 166, 167, 192, 193, 197, 202, 203]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 551 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/231 places, 198/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 202 /202 variables (removed 0) and now considering 198/198 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 612 ms. Remains : 202/231 places, 198/202 transitions.
Support contains 56 out of 202 places after structural reductions.
[2023-03-14 08:03:15] [INFO ] Flatten gal took : 59 ms
[2023-03-14 08:03:15] [INFO ] Flatten gal took : 26 ms
[2023-03-14 08:03:15] [INFO ] Input system was already deterministic with 198 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=18 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 198 rows 202 cols
[2023-03-14 08:03:15] [INFO ] Computed 34 place invariants in 7 ms
[2023-03-14 08:03:15] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:03:16] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:03:16] [INFO ] [Nat]Absence check using 18 positive and 16 generalized place invariants in 9 ms returned sat
[2023-03-14 08:03:16] [INFO ] After 114ms 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 1 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ParamProductionCell-PT-3-LTLFireability-12 TRUE 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' '!(X(X(G(p0))))'
Support contains 2 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 16 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2023-03-14 08:03:16] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-14 08:03:16] [INFO ] Implicit Places using invariants in 208 ms returned [16, 17, 28, 36, 40, 41, 68, 89, 102, 104, 173, 181, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 211 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/198 transitions.
Applied a total of 0 rules in 6 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 233 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s80 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-00 finished in 562 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))&&F(p1))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 10 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:17] [INFO ] Computed 34 place invariants in 4 ms
[2023-03-14 08:03:17] [INFO ] Implicit Places using invariants in 190 ms returned [16, 17, 28, 40, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 197 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 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 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-14 08:03:17] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:03:17] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-14 08:03:17] [INFO ] Invariant cache hit.
[2023-03-14 08:03:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:17] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 670 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (EQ s85 0) (EQ s122 0)) (OR (EQ s33 0) (EQ s46 0))), p1:(AND (EQ s85 1) (EQ s122 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 70 reset in 420 ms.
Stack based approach found an accepted trace after 1447 steps with 9 reset with depth 274 and stack size 274 in 15 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-01 finished in 1436 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&&(p1||(!p2 U p3))))))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 202 transition count 178
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 182 transition count 176
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 180 transition count 176
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 44 place count 180 transition count 160
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
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 5 with 64 rules applied. Total rules applied 146 place count 129 transition count 125
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 5 with 2 rules applied. Total rules applied 148 place count 128 transition count 124
Applied a total of 148 rules in 55 ms. Remains 128 /202 variables (removed 74) and now considering 124/198 (removed 74) transitions.
// Phase 1: matrix 124 rows 128 cols
[2023-03-14 08:03:18] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 08:03:18] [INFO ] Implicit Places using invariants in 158 ms returned [10, 11, 19, 25, 29, 30, 48, 59, 60, 70, 111, 121]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 159 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/202 places, 124/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 116 transition count 121
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 113 transition count 121
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 113 transition count 117
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 14 place count 109 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 107 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 107 transition count 115
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 46 place count 93 transition count 101
Applied a total of 46 rules in 24 ms. Remains 93 /116 variables (removed 23) and now considering 101/124 (removed 23) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-14 08:03:18] [INFO ] Computed 22 place invariants in 10 ms
[2023-03-14 08:03:18] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-14 08:03:18] [INFO ] Invariant cache hit.
[2023-03-14 08:03:18] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:19] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/202 places, 101/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 542 ms. Remains : 93/202 places, 101/198 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p0) (AND p1 p0) (AND p0 (NOT p2))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) p2) (AND (NOT p3) (NOT p0) p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (EQ s47 1) (EQ s55 1) (EQ s59 1)), p0:(OR (EQ s44 0) (EQ s48 0)), p1:(AND (EQ s44 1) (EQ s48 1)), p2:(AND (EQ s83 1) (EQ s86 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 1422 reset in 334 ms.
Stack based approach found an accepted trace after 16006 steps with 233 reset with depth 85 and stack size 85 in 54 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-02 finished in 1089 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||X(X((p1||G(p2))))))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 8 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:19] [INFO ] Computed 34 place invariants in 3 ms
[2023-03-14 08:03:19] [INFO ] Implicit Places using invariants in 177 ms returned [16, 17, 28, 36, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 182 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 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 7 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:03:19] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-14 08:03:19] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-14 08:03:19] [INFO ] Invariant cache hit.
[2023-03-14 08:03:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:20] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 623 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s36 1) (EQ s44 1)), p1:(AND (EQ s132 1) (EQ s155 1)), p2:(OR (EQ s6 0) (EQ s115 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-04 finished in 850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 7 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:20] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:03:20] [INFO ] Implicit Places using invariants in 164 ms returned [16, 28, 36, 40, 41, 68, 87, 89, 101, 103, 172, 180, 191]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 166 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 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 7 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:03:20] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:03:20] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-14 08:03:20] [INFO ] Invariant cache hit.
[2023-03-14 08:03:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:21] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 665 ms. Remains : 185/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s16 0) (EQ s17 0) (EQ s23 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Product exploration explored 100000 steps with 33333 reset in 250 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 59 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-3-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLFireability-05 finished in 1323 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 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 198/198 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 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 48 place count 178 transition count 160
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 144 place count 130 transition count 126
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 4 with 2 rules applied. Total rules applied 146 place count 129 transition count 125
Applied a total of 146 rules in 37 ms. Remains 129 /202 variables (removed 73) and now considering 125/198 (removed 73) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-14 08:03:21] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 08:03:21] [INFO ] Implicit Places using invariants in 147 ms returned [10, 11, 19, 25, 29, 30, 48, 59, 60, 70, 72, 112, 115, 122]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 152 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/202 places, 125/198 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 115 transition count 122
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 112 transition count 122
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 112 transition count 118
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 14 place count 108 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 106 transition count 116
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 106 transition count 116
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 60 place count 85 transition count 95
Applied a total of 60 rules in 19 ms. Remains 85 /115 variables (removed 30) and now considering 95/125 (removed 30) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-14 08:03:21] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 08:03:22] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-14 08:03:22] [INFO ] Invariant cache hit.
[2023-03-14 08:03:22] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:22] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/202 places, 95/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 486 ms. Remains : 85/202 places, 95/198 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-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 s38 1) (EQ s66 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 150 steps with 0 reset with depth 151 and stack size 151 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-06 finished in 665 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) U (G(X(p1)) U p2)))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 9 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:22] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:03:22] [INFO ] Implicit Places using invariants in 176 ms returned [16, 17, 28, 36, 40, 41, 68, 87, 89, 103, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 189 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 6 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:03:22] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:22] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-14 08:03:22] [INFO ] Invariant cache hit.
[2023-03-14 08:03:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:23] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 699 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (EQ s159 1) (EQ s160 1) (EQ s169 1)), p0:(OR (AND (EQ s108 1) (EQ s112 1)) (AND (EQ s159 1) (EQ s160 1) (EQ s169 1))), p1:(AND (EQ s91 1) (EQ s110...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-07 finished in 1006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(((G(p1)||X(X(G(p2)))) U p0)))))'
Support contains 2 out of 202 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 : 202/202 places, 198/198 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 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 48 place count 178 transition count 161
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 74 place count 165 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 163 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 163 transition count 159
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 163 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 162 transition count 158
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 4 with 48 rules applied. Total rules applied 128 place count 138 transition count 134
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 4 with 2 rules applied. Total rules applied 130 place count 137 transition count 133
Applied a total of 130 rules in 26 ms. Remains 137 /202 variables (removed 65) and now considering 133/198 (removed 65) transitions.
// Phase 1: matrix 133 rows 137 cols
[2023-03-14 08:03:23] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:03:23] [INFO ] Implicit Places using invariants in 149 ms returned [11, 12, 20, 26, 30, 31, 49, 60, 72, 74, 120, 123, 130]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 151 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 124/202 places, 133/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 131
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 121 transition count 130
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 121 transition count 128
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 10 place count 119 transition count 128
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 48 place count 100 transition count 109
Applied a total of 48 rules in 12 ms. Remains 100 /124 variables (removed 24) and now considering 109/133 (removed 24) transitions.
// Phase 1: matrix 109 rows 100 cols
[2023-03-14 08:03:23] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:03:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-14 08:03:23] [INFO ] Invariant cache hit.
[2023-03-14 08:03:23] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:23] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/202 places, 109/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 474 ms. Remains : 100/202 places, 109/198 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s15 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 1322 reset in 143 ms.
Product exploration explored 100000 steps with 1323 reset in 155 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 108 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 38 ms :[(NOT p0)]
Finished random walk after 71 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 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 p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-14 08:03:24] [INFO ] Invariant cache hit.
[2023-03-14 08:03:24] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:03:24] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:03:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:24] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-14 08:03:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:24] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-14 08:03:24] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:03:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:24] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-14 08:03:24] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:24] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 6 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 2 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 2 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 2 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 0 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:03:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 622 ms
[2023-03-14 08:03:25] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-14 08:03:25] [INFO ] Added : 84 causal constraints over 17 iterations in 241 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 100 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 : 100/100 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-14 08:03:25] [INFO ] Invariant cache hit.
[2023-03-14 08:03:25] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-14 08:03:25] [INFO ] Invariant cache hit.
[2023-03-14 08:03:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:26] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-14 08:03:26] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 08:03:26] [INFO ] Invariant cache hit.
[2023-03-14 08:03:26] [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 401 ms. Remains : 100/100 places, 109/109 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 111 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 35 ms :[(NOT p0)]
Finished random walk after 67 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2023-03-14 08:03:26] [INFO ] Invariant cache hit.
[2023-03-14 08:03:26] [INFO ] [Real]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-14 08:03:26] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:26] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-14 08:03:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-14 08:03:26] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:03:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:27] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-14 08:03:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:27] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-14 08:03:27] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 507 ms
[2023-03-14 08:03:27] [INFO ] Computed and/alt/rep : 100/241/100 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-14 08:03:27] [INFO ] Added : 84 causal constraints over 17 iterations in 215 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1312 reset in 141 ms.
Product exploration explored 100000 steps with 1329 reset in 161 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 109/109 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 100 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 99 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 99 transition count 107
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 4 place count 98 transition count 107
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 20 place count 90 transition count 99
Applied a total of 20 rules in 6 ms. Remains 90 /100 variables (removed 10) and now considering 99/109 (removed 10) transitions.
// Phase 1: matrix 99 rows 90 cols
[2023-03-14 08:03:28] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:03:28] [INFO ] Implicit Places using invariants in 96 ms returned [39]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 97 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/100 places, 99/109 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 85 transition count 95
Applied a total of 8 rules in 4 ms. Remains 85 /89 variables (removed 4) and now considering 95/99 (removed 4) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-14 08:03:28] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-14 08:03:28] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-14 08:03:28] [INFO ] Invariant cache hit.
[2023-03-14 08:03:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:28] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/100 places, 95/109 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 375 ms. Remains : 85/100 places, 95/109 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-08 finished in 5135 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(G((p1||X(F(p2)))))&&p0)))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 197
Applied a total of 2 rules in 4 ms. Remains 201 /202 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 201 cols
[2023-03-14 08:03:28] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 08:03:28] [INFO ] Implicit Places using invariants in 156 ms returned [16, 17, 28, 36, 40, 41, 68, 87, 101, 103, 173, 181, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 160 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 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 166 ms. Remains : 188/202 places, 197/198 transitions.
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s85 1) (EQ s108 1)), p1:(AND (EQ s81 1) (EQ s130 1)), p2:(OR (EQ s85 0) (EQ s143 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15 reset in 179 ms.
Stack based approach found an accepted trace after 530 steps with 0 reset with depth 531 and stack size 531 in 2 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-10 finished in 636 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(((G(F(!p0))||G(p1)) U X(p2))))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:29] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:03:29] [INFO ] Implicit Places using invariants in 207 ms returned [16, 17, 28, 36, 40, 68, 87, 89, 101, 103, 172, 180]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 209 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:03:29] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-14 08:03:29] [INFO ] Invariant cache hit.
[2023-03-14 08:03:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:29] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 662 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s162 1) (EQ s177 1) (EQ s183 1) (EQ s36 1) (EQ s43 1)), p0:(AND (EQ s162 1) (EQ s177 1) (EQ s183 1)), p2:(AND (EQ s36 1) (EQ s43 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, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 756 reset in 126 ms.
Product exploration explored 100000 steps with 845 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 848 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=35 ) properties (out of 9) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:03:31] [INFO ] Invariant cache hit.
[2023-03-14 08:03:31] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 1021 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-14 08:03:33] [INFO ] Invariant cache hit.
[2023-03-14 08:03:33] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-14 08:03:33] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-14 08:03:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:33] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2023-03-14 08:03:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:03:33] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:03:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:34] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-14 08:03:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:34] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 0 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 1 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2023-03-14 08:03:34] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 807 ms
[2023-03-14 08:03:34] [INFO ] Computed and/alt/rep : 191/311/191 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-14 08:03:35] [INFO ] Added : 180 causal constraints over 36 iterations in 752 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 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 186 transition count 157
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 149 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 148 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 76 place count 148 transition count 144
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 100 place count 136 transition count 144
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 184 place count 94 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 3 with 2 rules applied. Total rules applied 186 place count 93 transition count 101
Applied a total of 186 rules in 19 ms. Remains 93 /186 variables (removed 93) and now considering 101/194 (removed 93) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-14 08:03:35] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:35] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 08:03:35] [INFO ] Invariant cache hit.
[2023-03-14 08:03:35] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:35] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-14 08:03:35] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:03:35] [INFO ] Invariant cache hit.
[2023-03-14 08:03:36] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/186 places, 101/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 409 ms. Remains : 93/186 places, 101/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2), p0, p0]
Finished random walk after 14 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 407 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-14 08:03:37] [INFO ] Invariant cache hit.
[2023-03-14 08:03:37] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-14 08:03:37] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:03:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:37] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-14 08:03:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:37] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:03:37] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:37] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-14 08:03:37] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:37] [INFO ] [Nat]Added 67 Read/Feed constraints in 13 ms returned sat
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:03:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 3 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2023-03-14 08:03:38] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1103 ms
[2023-03-14 08:03:38] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 08:03:38] [INFO ] Added : 91 causal constraints over 19 iterations in 228 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), p0, p0]
Product exploration explored 100000 steps with 1758 reset in 134 ms.
Product exploration explored 100000 steps with 1731 reset in 227 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-14 08:03:39] [INFO ] Invariant cache hit.
[2023-03-14 08:03:39] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-14 08:03:39] [INFO ] Invariant cache hit.
[2023-03-14 08:03:39] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:39] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-14 08:03:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:03:39] [INFO ] Invariant cache hit.
[2023-03-14 08:03:39] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381 ms. Remains : 93/93 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-11 finished in 10657 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) U G((p0||G(p1))))||X(G(p2)))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 4 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:39] [INFO ] Computed 34 place invariants in 2 ms
[2023-03-14 08:03:40] [INFO ] Implicit Places using invariants in 147 ms returned [16, 17, 36, 40, 41, 68, 87, 101, 103, 172, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 150 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 156 ms. Remains : 188/202 places, 196/198 transitions.
Stuttering acceptance computed with spot in 728 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), false, p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND p0 p2), acceptance={} source=3 dest: 12}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 15}, { cond=(AND p0 p2), acceptance={} source=5 dest: 16}], [{ cond=p0, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p0 p1), acceptance={} source=9 dest: 13}], [{ cond=p0, acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={0, 1} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 11}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 12}, { cond=(AND p1 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p1 p2), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 13}, { cond=p0, acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 13}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 14}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s28 1)), p1:(AND (EQ s80 1) (EQ s130 1)), p2:(AND (EQ s80 1) (EQ s82 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24977 reset in 245 ms.
Product exploration explored 100000 steps with 24978 reset in 265 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 842 ms. Reduced automaton from 17 states, 55 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 188 cols
[2023-03-14 08:03:42] [INFO ] Computed 22 place invariants in 6 ms
[2023-03-14 08:03:42] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-14 08:03:42] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:03:42] [INFO ] After 91ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-14 08:03:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:42] [INFO ] After 26ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:03:42] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:03:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-14 08:03:42] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:03:42] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 08:03:42] [INFO ] After 24ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 08:03:42] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2023-03-14 08:03:42] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:03:42] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2023-03-14 08:03:43] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-14 08:03:43] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 0 ms to minimize.
[2023-03-14 08:03:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 294 ms
[2023-03-14 08:03:43] [INFO ] After 325ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-14 08:03:43] [INFO ] After 483ms 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 921 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-14 08:03:44] [INFO ] Invariant cache hit.
[2023-03-14 08:03:44] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:03:44] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 9 ms returned sat
[2023-03-14 08:03:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:44] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-14 08:03:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:03:44] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:03:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:45] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-14 08:03:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:45] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 0 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 0 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 3 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 1 ms to minimize.
[2023-03-14 08:03:45] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 0 ms to minimize.
[2023-03-14 08:03:46] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2023-03-14 08:03:46] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 1 ms to minimize.
[2023-03-14 08:03:46] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:03:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1109 ms
[2023-03-14 08:03:46] [INFO ] Computed and/alt/rep : 186/327/186 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-14 08:03:46] [INFO ] Added : 180 causal constraints over 36 iterations in 682 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 188 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-14 08:03:46] [INFO ] Invariant cache hit.
[2023-03-14 08:03:47] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-14 08:03:47] [INFO ] Invariant cache hit.
[2023-03-14 08:03:47] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:47] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2023-03-14 08:03:47] [INFO ] Invariant cache hit.
[2023-03-14 08:03:47] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 188/188 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 p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 532 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Finished random walk after 182 steps, including 0 resets, run visited all 6 properties in 8 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 638 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-14 08:03:49] [INFO ] Invariant cache hit.
[2023-03-14 08:03:49] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-03-14 08:03:49] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:03:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:49] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2023-03-14 08:03:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-03-14 08:03:49] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-14 08:03:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:50] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-14 08:03:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:50] [INFO ] [Nat]Added 68 Read/Feed constraints in 20 ms returned sat
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 0 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2023-03-14 08:03:50] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-14 08:03:51] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-14 08:03:51] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2023-03-14 08:03:51] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:03:51] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1070 ms
[2023-03-14 08:03:51] [INFO ] Computed and/alt/rep : 186/327/186 causal constraints (skipped 7 transitions) in 13 ms.
[2023-03-14 08:03:51] [INFO ] Added : 180 causal constraints over 36 iterations in 653 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33424 reset in 239 ms.
Product exploration explored 100000 steps with 33211 reset in 259 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 188 transition count 196
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 35 place count 188 transition count 198
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 49 place count 188 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 179 transition count 188
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 179 transition count 188
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 43 rules applied. Total rules applied 110 place count 179 transition count 188
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 135 place count 154 transition count 163
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 160 place count 154 transition count 163
Deduced a syphon composed of 58 places in 1 ms
Applied a total of 160 rules in 41 ms. Remains 154 /188 variables (removed 34) and now considering 163/196 (removed 33) transitions.
[2023-03-14 08:03:52] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 163 rows 154 cols
[2023-03-14 08:03:52] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:53] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 154/188 places, 163/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 196 ms. Remains : 154/188 places, 163/196 transitions.
Support contains 4 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 196/196 transitions.
Applied a total of 0 rules in 14 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 188 cols
[2023-03-14 08:03:53] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:53] [INFO ] Implicit Places using invariants in 111 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/188 places, 196/196 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 6 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:03:53] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-14 08:03:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-14 08:03:53] [INFO ] Invariant cache hit.
[2023-03-14 08:03:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:53] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/188 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 519 ms. Remains : 185/188 places, 194/196 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 13857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 200 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 200 transition count 196
Applied a total of 4 rules in 10 ms. Remains 200 /202 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 200 cols
[2023-03-14 08:03:53] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:03:53] [INFO ] Implicit Places using invariants in 146 ms returned [16, 17, 28, 40, 41, 68, 87, 89, 101, 103, 180, 191]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 148 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/198 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 5 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-14 08:03:53] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:53] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-14 08:03:53] [INFO ] Invariant cache hit.
[2023-03-14 08:03:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-14 08:03:54] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 575 ms. Remains : 186/202 places, 194/198 transitions.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (EQ s160 1) (EQ s168 1)) (AND (EQ s32 1) (EQ s33 1) (EQ s38 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLFireability-14 finished in 668 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(((G(p1)||X(X(G(p2)))) U 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(((G(F(!p0))||G(p1)) U X(p2))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-3-LTLFireability-11
Stuttering acceptance computed with spot in 263 ms :[(NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND (NOT p1) p0 (NOT p2)), p0, p0, (AND p0 (NOT p1))]
Support contains 5 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 198/198 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 202 transition count 176
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 180 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 179 transition count 175
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 46 place count 179 transition count 161
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 74 place count 165 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 163 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 163 transition count 159
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 163 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 162 transition count 158
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 5 with 64 rules applied. Total rules applied 144 place count 130 transition count 126
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 5 with 2 rules applied. Total rules applied 146 place count 129 transition count 125
Applied a total of 146 rules in 23 ms. Remains 129 /202 variables (removed 73) and now considering 125/198 (removed 73) transitions.
// Phase 1: matrix 125 rows 129 cols
[2023-03-14 08:03:54] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:03:54] [INFO ] Implicit Places using invariants in 139 ms returned [10, 11, 19, 25, 29, 48, 59, 60, 70, 72, 111, 114]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 140 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 117/202 places, 125/198 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 117 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 116 transition count 124
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 116 transition count 120
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 10 place count 112 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 110 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 110 transition count 118
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 48 place count 93 transition count 101
Applied a total of 48 rules in 10 ms. Remains 93 /117 variables (removed 24) and now considering 101/125 (removed 24) transitions.
// Phase 1: matrix 101 rows 93 cols
[2023-03-14 08:03:55] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:03:55] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-14 08:03:55] [INFO ] Invariant cache hit.
[2023-03-14 08:03:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:55] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 93/202 places, 101/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 462 ms. Remains : 93/202 places, 101/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(NOT p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=p0, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s81 1) (EQ s87 1) (EQ s90 1) (EQ s19 1) (EQ s25 1)), p0:(AND (EQ s81 1) (EQ s87 1) (EQ s90 1)), p2:(AND (EQ s19 1) (EQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1796 reset in 128 ms.
Product exploration explored 100000 steps with 1931 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 804 ms. Reduced automaton from 7 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (AND p1 (NOT p2) p0), (NOT p2), p0, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:03:56] [INFO ] Invariant cache hit.
[2023-03-14 08:03:56] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p0))), (G (NOT (AND p1 (NOT p2)))), (G (NOT (AND p1 (NOT p2) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p2) p0)), (F p2), (F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 17 factoid took 984 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-14 08:03:58] [INFO ] Invariant cache hit.
[2023-03-14 08:03:58] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:03:58] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:03:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:58] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-14 08:03:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:03:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:03:58] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:03:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:03:58] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-14 08:03:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:58] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2023-03-14 08:03:58] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:03:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-14 08:03:58] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-14 08:03:58] [INFO ] Added : 9 causal constraints over 2 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-14 08:03:58] [INFO ] Invariant cache hit.
[2023-03-14 08:03:58] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-14 08:03:58] [INFO ] Invariant cache hit.
[2023-03-14 08:03:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:03:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-14 08:03:58] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:03:58] [INFO ] Invariant cache hit.
[2023-03-14 08:03:58] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 395 ms. Remains : 93/93 places, 101/101 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)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 309 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), p0, p0]
Finished random walk after 115 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=115 )
Knowledge obtained : [(AND (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), true, (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 8 factoid took 389 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), p0, p0]
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), p0, p0]
[2023-03-14 08:04:00] [INFO ] Invariant cache hit.
[2023-03-14 08:04:00] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-14 08:04:00] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:04:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:04:00] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-14 08:04:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:04:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:04:00] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:04:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:04:00] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-14 08:04:00] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:00] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2023-03-14 08:04:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:04:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-14 08:04:00] [INFO ] Computed and/alt/rep : 99/225/99 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 08:04:00] [INFO ] Added : 9 causal constraints over 2 iterations in 39 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (NOT p2), p0, p0]
Product exploration explored 100000 steps with 1779 reset in 148 ms.
Product exploration explored 100000 steps with 1725 reset in 162 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2023-03-14 08:04:01] [INFO ] Invariant cache hit.
[2023-03-14 08:04:01] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 08:04:01] [INFO ] Invariant cache hit.
[2023-03-14 08:04:01] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:01] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-14 08:04:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:04:01] [INFO ] Invariant cache hit.
[2023-03-14 08:04:01] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 385 ms. Remains : 93/93 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-11 finished in 7070 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) U G((p0||G(p1))))||X(G(p2)))))'
Found a Lengthening insensitive property : ParamProductionCell-PT-3-LTLFireability-13
Stuttering acceptance computed with spot in 610 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), false, p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), false, true, (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 202/202 places, 198/198 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 202 transition count 174
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 178 transition count 174
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 48 place count 178 transition count 160
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 76 place count 164 transition count 160
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 78 place count 162 transition count 158
Iterating global reduction 2 with 2 rules applied. Total rules applied 80 place count 162 transition count 158
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 162 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 161 transition count 157
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 4 with 48 rules applied. Total rules applied 130 place count 137 transition count 133
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 4 with 2 rules applied. Total rules applied 132 place count 136 transition count 132
Applied a total of 132 rules in 11 ms. Remains 136 /202 variables (removed 66) and now considering 132/198 (removed 66) transitions.
// Phase 1: matrix 132 rows 136 cols
[2023-03-14 08:04:02] [INFO ] Computed 34 place invariants in 1 ms
[2023-03-14 08:04:02] [INFO ] Implicit Places using invariants in 143 ms returned [10, 11, 25, 29, 30, 48, 59, 71, 73, 119, 122, 129]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 144 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 124/202 places, 132/198 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 124 transition count 130
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 122 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 121 transition count 129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 126
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 118 transition count 126
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 3 with 36 rules applied. Total rules applied 48 place count 100 transition count 108
Applied a total of 48 rules in 6 ms. Remains 100 /124 variables (removed 24) and now considering 108/132 (removed 24) transitions.
// Phase 1: matrix 108 rows 100 cols
[2023-03-14 08:04:02] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:04:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-14 08:04:02] [INFO ] Invariant cache hit.
[2023-03-14 08:04:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:02] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 100/202 places, 108/198 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 470 ms. Remains : 100/202 places, 108/198 transitions.
Running random walk in product with property : ParamProductionCell-PT-3-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 4}, { cond=(AND p0 p2), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 6}, { cond=(NOT p2), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 10}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 11}, { cond=(AND p0 p2), acceptance={} source=3 dest: 12}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 11}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 12}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 13}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 14}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 15}, { cond=(AND p0 p2), acceptance={} source=5 dest: 16}], [{ cond=p0, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(OR p0 p1), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=7 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={1} source=8 dest: 8}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}, { cond=p0, acceptance={} source=8 dest: 10}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p0 p1), acceptance={} source=9 dest: 13}], [{ cond=p0, acceptance={} source=10 dest: 15}], [{ cond=true, acceptance={0, 1} source=11 dest: 11}], [{ cond=(NOT p2), acceptance={} source=12 dest: 11}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(NOT p1), acceptance={} source=13 dest: 11}, { cond=p1, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=14 dest: 12}, { cond=(AND p1 (NOT p2)), acceptance={} source=14 dest: 13}, { cond=(AND p1 p2), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 13}, { cond=p0, acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 11}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=16 dest: 13}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 14}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s15 1)), p1:(AND (EQ s40 1) (EQ s71 1)), p2:(AND (EQ s40 1) (EQ s41 1) (EQ s58 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24974 reset in 182 ms.
Product exploration explored 100000 steps with 25021 reset in 200 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 850 ms. Reduced automaton from 17 states, 55 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) p0), p0, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) p0), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 08:04:04] [INFO ] Invariant cache hit.
[2023-03-14 08:04:04] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-14 08:04:04] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 08:04:04] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:04:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-14 08:04:04] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-14 08:04:04] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 08:04:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:04] [INFO ] After 16ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 08:04:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-14 08:04:04] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:04:04] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:04:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2023-03-14 08:04:04] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 162 ms
[2023-03-14 08:04:04] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-14 08:04:04] [INFO ] After 280ms 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) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F p0), (F (OR p0 p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 1136 ms. Reduced automaton from 8 states, 24 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-14 08:04:06] [INFO ] Invariant cache hit.
[2023-03-14 08:04:06] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:04:06] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:04:06] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-14 08:04:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:04:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:04:06] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:04:06] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-14 08:04:06] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:06] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:04:06] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:04:07] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2023-03-14 08:04:07] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2023-03-14 08:04:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-14 08:04:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 579 ms
[2023-03-14 08:04:07] [INFO ] Computed and/alt/rep : 99/242/99 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-14 08:04:07] [INFO ] Added : 85 causal constraints over 17 iterations in 209 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-14 08:04:07] [INFO ] Invariant cache hit.
[2023-03-14 08:04:07] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-14 08:04:07] [INFO ] Invariant cache hit.
[2023-03-14 08:04:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:07] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-14 08:04:07] [INFO ] Invariant cache hit.
[2023-03-14 08:04:07] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 420 ms. Remains : 100/100 places, 108/108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 491 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Finished random walk after 129 steps, including 0 resets, run visited all 6 properties in 4 ms. (steps per millisecond=32 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), true, (X (X (NOT (OR p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR (AND (NOT p0) (NOT p1)) (AND p0 p1)))), (F (OR (AND (NOT p0) p1) (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 634 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 6 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
[2023-03-14 08:04:09] [INFO ] Invariant cache hit.
[2023-03-14 08:04:09] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-14 08:04:09] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-14 08:04:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:04:09] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-14 08:04:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:04:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-14 08:04:09] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-14 08:04:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:04:09] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-14 08:04:09] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-14 08:04:09] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-14 08:04:09] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-03-14 08:04:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-14 08:04:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 576 ms
[2023-03-14 08:04:10] [INFO ] Computed and/alt/rep : 99/242/99 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-14 08:04:10] [INFO ] Added : 85 causal constraints over 17 iterations in 222 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 270 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33313 reset in 182 ms.
Product exploration explored 100000 steps with 33353 reset in 200 ms.
Applying partial POR strategy [false, true, true, true, true, true]
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p1) p0), p0, (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), (OR (AND p0 p1) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) (NOT p1))]
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 100 transition count 108
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 7 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-14 08:04:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 108 rows 100 cols
[2023-03-14 08:04:11] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:04:11] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/100 places, 108/108 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 100/100 places, 108/108 transitions.
Support contains 4 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
// Phase 1: matrix 108 rows 100 cols
[2023-03-14 08:04:11] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-14 08:04:11] [INFO ] Implicit Places using invariants in 101 ms returned [41]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 103 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 99/100 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 99 /99 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 99/100 places, 108/108 transitions.
Treatment of property ParamProductionCell-PT-3-LTLFireability-13 finished in 10344 ms.
[2023-03-14 08:04:11] [INFO ] Flatten gal took : 18 ms
[2023-03-14 08:04:11] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-14 08:04:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 202 places, 198 transitions and 714 arcs took 3 ms.
Total runtime 58433 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-3
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/365
LTLFireability

FORMULA ParamProductionCell-PT-3-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678781203188

--------------------
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/365/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/365/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/365/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 6 (type EXCL) for 3 ParamProductionCell-PT-3-LTLFireability-11
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for ParamProductionCell-PT-3-LTLFireability-11
lola: result : true
lola: markings : 13692
lola: fired transitions : 23237
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 11 (type EXCL) for 10 ParamProductionCell-PT-3-LTLFireability-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: FINISHED task # 11 (type EXCL) for ParamProductionCell-PT-3-LTLFireability-13
lola: result : false
lola: markings : 667
lola: fired transitions : 667
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 8 (type EXCL) for 3 ParamProductionCell-PT-3-LTLFireability-11
lola: time limit : 1800 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1800 6/32 ParamProductionCell-PT-3-LTLFireability-11 800947 m, 160189 m/sec, 2444153 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1800 10/32 ParamProductionCell-PT-3-LTLFireability-11 1432118 m, 126234 m/sec, 4989753 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1800 13/32 ParamProductionCell-PT-3-LTLFireability-11 1796220 m, 72820 m/sec, 7556081 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1800 16/32 ParamProductionCell-PT-3-LTLFireability-11 2229719 m, 86699 m/sec, 10337731 t fired, .

Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1800 18/32 ParamProductionCell-PT-3-LTLFireability-11 2605926 m, 75241 m/sec, 13208010 t fired, .

Time elapsed: 25 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1800 20/32 ParamProductionCell-PT-3-LTLFireability-11 2960335 m, 70881 m/sec, 16069713 t fired, .

Time elapsed: 30 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1800 21/32 ParamProductionCell-PT-3-LTLFireability-11 3095158 m, 26964 m/sec, 18806511 t fired, .

Time elapsed: 35 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1800 24/32 ParamProductionCell-PT-3-LTLFireability-11 3548028 m, 90574 m/sec, 21568490 t fired, .

Time elapsed: 40 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/1800 27/32 ParamProductionCell-PT-3-LTLFireability-11 3943145 m, 79023 m/sec, 24349660 t fired, .

Time elapsed: 45 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/1800 29/32 ParamProductionCell-PT-3-LTLFireability-11 4357004 m, 82771 m/sec, 27170442 t fired, .

Time elapsed: 50 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 55/1800 32/32 ParamProductionCell-PT-3-LTLFireability-11 4753341 m, 79267 m/sec, 30007328 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 8 (type EXCL) for ParamProductionCell-PT-3-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

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

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-3-LTLFireability-08
lola: time limit : 3540 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3540 3/32 ParamProductionCell-PT-3-LTLFireability-08 380899 m, 76179 m/sec, 3213622 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3540 5/32 ParamProductionCell-PT-3-LTLFireability-08 717974 m, 67415 m/sec, 6460378 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3540 7/32 ParamProductionCell-PT-3-LTLFireability-08 1041071 m, 64619 m/sec, 9650360 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3540 9/32 ParamProductionCell-PT-3-LTLFireability-08 1372559 m, 66297 m/sec, 12757314 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3540 11/32 ParamProductionCell-PT-3-LTLFireability-08 1694648 m, 64417 m/sec, 15819617 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3540 13/32 ParamProductionCell-PT-3-LTLFireability-08 2010721 m, 63214 m/sec, 18803756 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3540 16/32 ParamProductionCell-PT-3-LTLFireability-08 2341251 m, 66106 m/sec, 21837619 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3540 18/32 ParamProductionCell-PT-3-LTLFireability-08 2649249 m, 61599 m/sec, 24945148 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3540 19/32 ParamProductionCell-PT-3-LTLFireability-08 2947916 m, 59733 m/sec, 27990683 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3540 21/32 ParamProductionCell-PT-3-LTLFireability-08 3251518 m, 60720 m/sec, 31098122 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3540 23/32 ParamProductionCell-PT-3-LTLFireability-08 3554687 m, 60633 m/sec, 34201777 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3540 25/32 ParamProductionCell-PT-3-LTLFireability-08 3852886 m, 59639 m/sec, 37262068 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3540 27/32 ParamProductionCell-PT-3-LTLFireability-08 4122026 m, 53828 m/sec, 40015203 t fired, .

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3540 29/32 ParamProductionCell-PT-3-LTLFireability-08 4414550 m, 58504 m/sec, 43001123 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3540 30/32 ParamProductionCell-PT-3-LTLFireability-08 4609886 m, 39067 m/sec, 46142253 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3540 31/32 ParamProductionCell-PT-3-LTLFireability-08 4739773 m, 25977 m/sec, 49289477 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3540 32/32 ParamProductionCell-PT-3-LTLFireability-08 4893663 m, 30778 m/sec, 52298120 t fired, .

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ParamProductionCell-PT-3-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ParamProductionCell-PT-3-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ParamProductionCell-PT-3-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-3-LTLFireability-08: LTL unknown AGGR
ParamProductionCell-PT-3-LTLFireability-11: CONJ unknown CONJ
ParamProductionCell-PT-3-LTLFireability-13: LTL false LTL model checker


Time elapsed: 150 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-3"
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-3, 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-167863538200388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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