Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r265-smll-167863540000404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ParamProductionCell-PT-5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540000404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 656K
-rw-r--r-- 1 mcc users 7.2K Feb 26 17:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 26 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 174K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678995855125

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 19:44:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 19:44:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:44:17] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2023-03-16 19:44:17] [INFO ] Transformed 231 places.
[2023-03-16 19:44:17] [INFO ] Transformed 202 transitions.
[2023-03-16 19:44:17] [INFO ] Found NUPN structural information;
[2023-03-16 19:44:17] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 50 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2023-03-16 19:44:18] [INFO ] Computed 59 place invariants in 23 ms
[2023-03-16 19:44:18] [INFO ] Implicit Places using invariants in 524 ms returned [15, 16, 18, 19, 24, 35, 36, 42, 47, 59, 64, 65, 73, 79, 113, 118, 119, 160, 162, 164, 165, 190, 191, 194, 195, 200, 201, 205, 216]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 572 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 196/231 places, 196/202 transitions.
Applied a total of 0 rules in 21 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 644 ms. Remains : 196/231 places, 196/202 transitions.
Support contains 47 out of 196 places after structural reductions.
[2023-03-16 19:44:19] [INFO ] Flatten gal took : 62 ms
[2023-03-16 19:44:19] [INFO ] Flatten gal took : 25 ms
[2023-03-16 19:44:19] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=20 ) properties (out of 26) seen :24
Finished Best-First random walk after 3277 steps, including 0 resets, run visited all 2 properties in 19 ms. (steps per millisecond=172 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:20] [INFO ] Computed 30 place invariants in 5 ms
[2023-03-16 19:44:20] [INFO ] Implicit Places using invariants in 235 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 101, 142]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 237 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 11 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-16 19:44:20] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-16 19:44:20] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-16 19:44:20] [INFO ] Invariant cache hit.
[2023-03-16 19:44:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:20] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 801 ms. Remains : 184/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s84 0) (EQ s121 0)), p1:(AND (EQ s84 1) (EQ s121 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 26 reset in 376 ms.
Stack based approach found an accepted trace after 255 steps with 0 reset with depth 256 and stack size 256 in 2 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 1589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 163
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 163 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 163 transition count 152
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 152 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 134 place count 129 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 127 transition count 127
Applied a total of 138 rules in 40 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-16 19:44:21] [INFO ] Computed 30 place invariants in 3 ms
[2023-03-16 19:44:21] [INFO ] Implicit Places using invariants in 187 ms returned [14, 19, 22, 39, 50, 53, 65, 67, 97]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 189 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/196 places, 127/196 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 118 transition count 124
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 115 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 113 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 113 transition count 122
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 34 place count 101 transition count 110
Applied a total of 34 rules in 17 ms. Remains 101 /118 variables (removed 17) and now considering 110/127 (removed 17) transitions.
// Phase 1: matrix 110 rows 101 cols
[2023-03-16 19:44:21] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:22] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-16 19:44:22] [INFO ] Invariant cache hit.
[2023-03-16 19:44:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:22] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/196 places, 110/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 559 ms. Remains : 101/196 places, 110/196 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s38 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 258 reset in 211 ms.
Stack based approach found an accepted trace after 169 steps with 0 reset with depth 170 and stack size 170 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-03 finished in 859 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 X(!p1)))'
Support contains 5 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:22] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-16 19:44:22] [INFO ] Implicit Places using invariants in 194 ms returned [26, 38, 65, 84, 85, 87, 99, 101, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 197 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 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-16 19:44:22] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-16 19:44:22] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-16 19:44:22] [INFO ] Invariant cache hit.
[2023-03-16 19:44:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:23] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 670 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 172 ms :[p1, p1, p1, true, p0]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s31 1) (EQ s33 1) (EQ s47 1)), p1:(AND (EQ s149 1) (EQ s153 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 335 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLFireability-05 finished in 1858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(F(p0))||G(p1))) U p2))'
Support contains 8 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 196 transition count 165
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 165 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 64 place count 164 transition count 154
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 84 place count 154 transition count 154
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 130 place count 131 transition count 131
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 134 place count 129 transition count 129
Applied a total of 134 rules in 29 ms. Remains 129 /196 variables (removed 67) and now considering 129/196 (removed 67) transitions.
// Phase 1: matrix 129 rows 129 cols
[2023-03-16 19:44:24] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-16 19:44:24] [INFO ] Implicit Places using invariants in 146 ms returned [14, 20, 23, 41, 53, 67, 69, 99]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 152 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/196 places, 129/196 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 121 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 128
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 120 transition count 125
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 117 transition count 125
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 30 place count 106 transition count 114
Applied a total of 30 rules in 17 ms. Remains 106 /121 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 106 cols
[2023-03-16 19:44:24] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-16 19:44:24] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-16 19:44:24] [INFO ] Invariant cache hit.
[2023-03-16 19:44:24] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:24] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 106/196 places, 114/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 522 ms. Remains : 106/196 places, 114/196 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (EQ s4 1) (EQ s29 1)) (AND (EQ s40 1) (EQ s46 1) (EQ s87 1))), p0:(AND (EQ s40 1) (EQ s46 1) (EQ s87 1)), p1:(AND (EQ s42 1) (EQ s45 1) (EQ s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 159 reset in 160 ms.
Stack based approach found an accepted trace after 109 steps with 0 reset with depth 110 and stack size 110 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-06 finished in 829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((!p0||F(!p1)))) U (p0||F(p2)))))'
Support contains 6 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 196 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 64 place count 164 transition count 154
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 154 transition count 154
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 126 place count 133 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 131 transition count 131
Applied a total of 130 rules in 22 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2023-03-16 19:44:25] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:25] [INFO ] Implicit Places using invariants in 151 ms returned [15, 20, 23, 40, 53, 54, 56, 68, 70, 100]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 155 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/196 places, 131/196 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 121 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 120 transition count 130
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 120 transition count 126
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 116 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 114 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 114 transition count 124
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 64 place count 89 transition count 99
Applied a total of 64 rules in 17 ms. Remains 89 /121 variables (removed 32) and now considering 99/131 (removed 32) transitions.
// Phase 1: matrix 99 rows 89 cols
[2023-03-16 19:44:25] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:44:25] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-16 19:44:25] [INFO ] Invariant cache hit.
[2023-03-16 19:44:25] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:25] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/196 places, 99/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 509 ms. Remains : 89/196 places, 99/196 transitions.
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 p1), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p2) p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s35 1)), p2:(AND (EQ s77 1) (EQ s81 1)), p1:(AND (EQ s41 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1432 reset in 138 ms.
Product exploration explored 100000 steps with 1438 reset in 166 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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 336 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p0 p1), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-16 19:44:26] [INFO ] Invariant cache hit.
[2023-03-16 19:44:26] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 19:44:26] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 19:44:26] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 19:44:26] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 19:44:26] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 19:44:26] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 19:44:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:26] [INFO ] After 21ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 19:44:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 4 ms to minimize.
[2023-03-16 19:44:27] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2023-03-16 19:44:27] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 2 ms to minimize.
[2023-03-16 19:44:27] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:27] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2023-03-16 19:44:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 289 ms
[2023-03-16 19:44:27] [INFO ] After 316ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-16 19:44:27] [INFO ] After 426ms 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 p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2)]
Knowledge based reduction with 9 factoid took 447 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-16 19:44:27] [INFO ] Invariant cache hit.
[2023-03-16 19:44:28] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-16 19:44:28] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 19:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:28] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-16 19:44:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:44:28] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-16 19:44:28] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-16 19:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:28] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-16 19:44:28] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:28] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2023-03-16 19:44:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 687 ms
[2023-03-16 19:44:28] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 19:44:29] [INFO ] Added : 74 causal constraints over 15 iterations in 199 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 89 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 : 89/89 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-16 19:44:29] [INFO ] Invariant cache hit.
[2023-03-16 19:44:29] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-16 19:44:29] [INFO ] Invariant cache hit.
[2023-03-16 19:44:29] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:29] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-16 19:44:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:44:29] [INFO ] Invariant cache hit.
[2023-03-16 19:44:29] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 441 ms. Remains : 89/89 places, 99/99 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 p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (X (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 3 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-16 19:44:30] [INFO ] Invariant cache hit.
[2023-03-16 19:44:30] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 19:44:30] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 19:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:30] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2023-03-16 19:44:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:44:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 19:44:30] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-16 19:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:30] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-16 19:44:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:30] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2023-03-16 19:44:30] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-16 19:44:31] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:44:31] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:31] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2023-03-16 19:44:31] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2023-03-16 19:44:31] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 672 ms
[2023-03-16 19:44:31] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 19:44:31] [INFO ] Added : 74 causal constraints over 15 iterations in 192 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2348 reset in 171 ms.
Product exploration explored 100000 steps with 2361 reset in 272 ms.
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 99/99 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 98
Applied a total of 2 rules in 7 ms. Remains 88 /89 variables (removed 1) and now considering 98/99 (removed 1) transitions.
// Phase 1: matrix 98 rows 88 cols
[2023-03-16 19:44:31] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:44:32] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-16 19:44:32] [INFO ] Invariant cache hit.
[2023-03-16 19:44:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:32] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-16 19:44:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:44:32] [INFO ] Invariant cache hit.
[2023-03-16 19:44:32] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/89 places, 98/99 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 88/89 places, 98/99 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 7193 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:32] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:32] [INFO ] Implicit Places using invariants in 158 ms returned [26, 65, 84, 85, 87, 99, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 163 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 8 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 19:44:32] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:44:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-16 19:44:32] [INFO ] Invariant cache hit.
[2023-03-16 19:44:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:33] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 615 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s13 1) (EQ s71 1) (EQ s33 1) (EQ s47 1)), p1:(OR (EQ s35 0) (EQ s37 0) (EQ s46 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:33] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:33] [INFO ] Implicit Places using invariants in 213 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 101]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 214 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 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 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-16 19:44:33] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:33] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-16 19:44:33] [INFO ] Invariant cache hit.
[2023-03-16 19:44:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:33] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 709 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s131 1) (EQ s132 1) (EQ s153 1)), p0:(NEQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 239 ms.
Product exploration explored 100000 steps with 25000 reset in 272 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) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 141 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-16 19:44:35] [INFO ] Invariant cache hit.
[2023-03-16 19:44:35] [INFO ] Implicit Places using invariants in 139 ms returned []
[2023-03-16 19:44:35] [INFO ] Invariant cache hit.
[2023-03-16 19:44:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:35] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2023-03-16 19:44:35] [INFO ] Invariant cache hit.
[2023-03-16 19:44:35] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 674 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Finished Best-First random walk after 448 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=448 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 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 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 35 place count 185 transition count 196
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 185 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 56 place count 177 transition count 187
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 64 place count 177 transition count 187
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 104 place count 177 transition count 187
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 128 place count 153 transition count 163
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 152 place count 153 transition count 163
Deduced a syphon composed of 56 places in 0 ms
Applied a total of 152 rules in 30 ms. Remains 153 /185 variables (removed 32) and now considering 163/194 (removed 31) transitions.
[2023-03-16 19:44:37] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-16 19:44:37] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:37] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/185 places, 163/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 153/185 places, 163/194 transitions.
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 19:44:37] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-16 19:44:37] [INFO ] Invariant cache hit.
[2023-03-16 19:44:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:38] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2023-03-16 19:44:38] [INFO ] Invariant cache hit.
[2023-03-16 19:44:38] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 632 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 5189 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 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 163
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 163 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 163 transition count 152
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 152 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 134 place count 129 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 127 transition count 127
Applied a total of 138 rules in 19 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-16 19:44:38] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-16 19:44:38] [INFO ] Implicit Places using invariants in 139 ms returned [14, 19, 22, 39, 50, 51, 53, 65, 67, 97]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 142 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/196 places, 127/196 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 126
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 126
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 122
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 112 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 110 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 110 transition count 120
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 66 place count 84 transition count 94
Applied a total of 66 rules in 15 ms. Remains 84 /117 variables (removed 33) and now considering 94/127 (removed 33) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-16 19:44:38] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:44:38] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-16 19:44:38] [INFO ] Invariant cache hit.
[2023-03-16 19:44:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:38] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 84/196 places, 94/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 430 ms. Remains : 84/196 places, 94/196 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10 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 s47 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 132 ms.
Stack based approach found an accepted trace after 176 steps with 0 reset with depth 177 and stack size 177 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:39] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:39] [INFO ] Implicit Places using invariants in 155 ms returned [26, 34, 38, 65, 84, 85, 99, 101, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 158 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 187/196 places, 196/196 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s81 1) (EQ s84 1) (EQ s89 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-5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-16 19:44:39] [INFO ] Invariant cache hit.
[2023-03-16 19:44:39] [INFO ] Implicit Places using invariants in 204 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 206 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/196 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 5 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 19:44:39] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:39] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-16 19:44:39] [INFO ] Invariant cache hit.
[2023-03-16 19:44:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:40] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 681 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s92 0) (EQ s113 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 175 ms.
Product exploration explored 100000 steps with 25000 reset in 192 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 93 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=93 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 1 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-16 19:44:41] [INFO ] Invariant cache hit.
[2023-03-16 19:44:41] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-16 19:44:41] [INFO ] Invariant cache hit.
[2023-03-16 19:44:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:41] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2023-03-16 19:44:41] [INFO ] Invariant cache hit.
[2023-03-16 19:44:41] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 649 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 179 ms.
Product exploration explored 100000 steps with 25000 reset in 191 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 185 transition count 194
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 38 place count 185 transition count 196
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 51 place count 185 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 175 transition count 185
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 175 transition count 185
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 110 place count 175 transition count 185
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 133 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 156 place count 152 transition count 162
Deduced a syphon composed of 57 places in 0 ms
Applied a total of 156 rules in 24 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2023-03-16 19:44:43] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2023-03-16 19:44:43] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-16 19:44:43] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 162/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 181 ms. Remains : 152/185 places, 162/194 transitions.
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-16 19:44:43] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:43] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-16 19:44:43] [INFO ] Invariant cache hit.
[2023-03-16 19:44:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:43] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2023-03-16 19:44:43] [INFO ] Invariant cache hit.
[2023-03-16 19:44:44] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 185/185 places, 194/194 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-12 finished in 4798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 196 transition count 164
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 64 place count 164 transition count 153
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 86 place count 153 transition count 153
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 132 place count 130 transition count 130
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 136 place count 128 transition count 128
Applied a total of 136 rules in 13 ms. Remains 128 /196 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 128 cols
[2023-03-16 19:44:44] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:44] [INFO ] Implicit Places using invariants in 179 ms returned [14, 20, 23, 40, 52, 54, 66, 68, 98]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 181 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/196 places, 128/196 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 119 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 118 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 118 transition count 125
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 116 transition count 125
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 52 place count 93 transition count 102
Applied a total of 52 rules in 7 ms. Remains 93 /119 variables (removed 26) and now considering 102/128 (removed 26) transitions.
// Phase 1: matrix 102 rows 93 cols
[2023-03-16 19:44:44] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:44] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-16 19:44:44] [INFO ] Invariant cache hit.
[2023-03-16 19:44:44] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:44] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/196 places, 102/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 595 ms. Remains : 93/196 places, 102/196 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s12 1), p1:(OR (EQ s40 0) (EQ s44 0) (EQ s75 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2212 reset in 159 ms.
Product exploration explored 100000 steps with 2257 reset in 144 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1184 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=296 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-16 19:44:45] [INFO ] Invariant cache hit.
[2023-03-16 19:44:46] [INFO ] [Real]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 19:44:46] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:46] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-16 19:44:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:44:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-16 19:44:46] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-16 19:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-16 19:44:46] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:46] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 4 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:44:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 4 ms to minimize.
[2023-03-16 19:44:47] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1164 ms
[2023-03-16 19:44:47] [INFO ] Computed and/alt/rep : 99/245/99 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 19:44:47] [INFO ] Added : 79 causal constraints over 16 iterations in 204 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 102/102 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-16 19:44:47] [INFO ] Invariant cache hit.
[2023-03-16 19:44:47] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-16 19:44:47] [INFO ] Invariant cache hit.
[2023-03-16 19:44:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:47] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-16 19:44:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 19:44:48] [INFO ] Invariant cache hit.
[2023-03-16 19:44:48] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 468 ms. Remains : 93/93 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 1096 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=274 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-16 19:44:48] [INFO ] Invariant cache hit.
[2023-03-16 19:44:48] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 19:44:48] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 19:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:49] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-16 19:44:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:44:49] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2023-03-16 19:44:49] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-16 19:44:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:44:49] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-16 19:44:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2023-03-16 19:44:49] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2023-03-16 19:44:50] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1131 ms
[2023-03-16 19:44:50] [INFO ] Computed and/alt/rep : 99/245/99 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-16 19:44:50] [INFO ] Added : 79 causal constraints over 16 iterations in 208 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2262 reset in 126 ms.
Product exploration explored 100000 steps with 2217 reset in 144 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 102/102 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-16 19:44:50] [INFO ] Invariant cache hit.
[2023-03-16 19:44:51] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-16 19:44:51] [INFO ] Invariant cache hit.
[2023-03-16 19:44:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:51] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-16 19:44:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 19:44:51] [INFO ] Invariant cache hit.
[2023-03-16 19:44:51] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 93/93 places, 102/102 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 7263 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 p1) U p2)) U !F(p1)))'
Support contains 6 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:51] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-16 19:44:51] [INFO ] Implicit Places using invariants in 207 ms returned [26, 34, 38, 65, 84, 87, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 208 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 7 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 19:44:51] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:44:51] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-16 19:44:51] [INFO ] Invariant cache hit.
[2023-03-16 19:44:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:52] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 740 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 257 ms :[p1, (NOT p2), false, (OR (NOT p0) (NOT p1)), true, (AND (NOT p0) p1), p1]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 4}, { cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s80 1) (EQ s83 1)), p2:(AND (EQ s92 1) (EQ s111 1)), p0:(AND (EQ s14 1) (EQ s70 1))], 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 278 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 1020 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X((p1||G(p2))))))'
Support contains 7 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-16 19:44:52] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:52] [INFO ] Implicit Places using invariants in 207 ms returned [34, 38, 84, 85, 87, 99, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 209 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/196 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2023-03-16 19:44:52] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-16 19:44:52] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-16 19:44:52] [INFO ] Invariant cache hit.
[2023-03-16 19:44:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:44:53] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/196 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 677 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ 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 s61 1) (EQ s63 1) (EQ s70 1) (EQ s26 1) (EQ s28 1)), p1:(AND (EQ s174 1) (EQ s181 1)), p2:(AND (EQ s26 1) (EQ s28 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2537 steps with 1 reset in 3 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((!p0||F(!p1)))) U (p0||F(p2)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Found a Shortening insensitive property : ParamProductionCell-PT-5-LTLFireability-09
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 196 transition count 166
Reduce places removed 30 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 62 place count 166 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 64 place count 164 transition count 164
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 64 place count 164 transition count 154
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 84 place count 154 transition count 154
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 3 with 42 rules applied. Total rules applied 126 place count 133 transition count 133
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 130 place count 131 transition count 131
Applied a total of 130 rules in 11 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2023-03-16 19:44:53] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:53] [INFO ] Implicit Places using invariants in 181 ms returned [15, 20, 23, 40, 52, 53, 55, 67, 69]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 182 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 122/196 places, 131/196 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 122 transition count 130
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 121 transition count 130
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 2 place count 121 transition count 123
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 114 transition count 123
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 112 transition count 121
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 112 transition count 121
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 62 place count 91 transition count 100
Applied a total of 62 rules in 6 ms. Remains 91 /122 variables (removed 31) and now considering 100/131 (removed 31) transitions.
// Phase 1: matrix 100 rows 91 cols
[2023-03-16 19:44:53] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-16 19:44:53] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-16 19:44:53] [INFO ] Invariant cache hit.
[2023-03-16 19:44:54] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 91/196 places, 100/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 492 ms. Remains : 91/196 places, 100/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s64 1) (EQ s65 1) (EQ s76 1)), p0:(NEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 139 ms.
Product exploration explored 100000 steps with 25000 reset in 156 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) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 208 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-16 19:44:55] [INFO ] Invariant cache hit.
[2023-03-16 19:44:55] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-16 19:44:55] [INFO ] Invariant cache hit.
[2023-03-16 19:44:55] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:55] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2023-03-16 19:44:55] [INFO ] Invariant cache hit.
[2023-03-16 19:44:55] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 91/91 places, 100/100 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 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 258 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1119 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=279 )
Knowledge obtained : [(AND p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 137 ms.
Product exploration explored 100000 steps with 25000 reset in 155 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-16 19:44:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 19:44:57] [INFO ] Invariant cache hit.
[2023-03-16 19:44:57] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 91/91 places, 100/100 transitions.
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 100/100 transitions.
Applied a total of 0 rules in 0 ms. Remains 91 /91 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2023-03-16 19:44:57] [INFO ] Invariant cache hit.
[2023-03-16 19:44:57] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-16 19:44:57] [INFO ] Invariant cache hit.
[2023-03-16 19:44:57] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:57] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-16 19:44:57] [INFO ] Invariant cache hit.
[2023-03-16 19:44:57] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 91/91 places, 100/100 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 4133 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : ParamProductionCell-PT-5-LTLFireability-12
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 196 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 196 transition count 163
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 163 transition count 163
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 66 place count 163 transition count 152
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 152 transition count 152
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 134 place count 129 transition count 129
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 138 place count 127 transition count 127
Applied a total of 138 rules in 12 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-16 19:44:57] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-16 19:44:57] [INFO ] Implicit Places using invariants in 170 ms returned [14, 19, 22, 39, 50, 51, 53, 65, 97]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 175 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 118/196 places, 127/196 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 118 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 117 transition count 126
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 117 transition count 122
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 113 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 111 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 111 transition count 120
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 58 place count 89 transition count 98
Applied a total of 58 rules in 10 ms. Remains 89 /118 variables (removed 29) and now considering 98/127 (removed 29) transitions.
// Phase 1: matrix 98 rows 89 cols
[2023-03-16 19:44:57] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:44:58] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-16 19:44:58] [INFO ] Invariant cache hit.
[2023-03-16 19:44:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:58] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 89/196 places, 98/196 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 491 ms. Remains : 89/196 places, 98/196 transitions.
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s46 0) (EQ s57 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Product exploration explored 100000 steps with 25000 reset in 151 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, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 19:44:59] [INFO ] Invariant cache hit.
[2023-03-16 19:44:59] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-16 19:44:59] [INFO ] Invariant cache hit.
[2023-03-16 19:44:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:59] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-16 19:44:59] [INFO ] Invariant cache hit.
[2023-03-16 19:44:59] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 89/89 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 134 ms.
Product exploration explored 100000 steps with 25000 reset in 151 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 19:45:00] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-16 19:45:00] [INFO ] Invariant cache hit.
[2023-03-16 19:45:00] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 89/89 places, 98/98 transitions.
Support contains 2 out of 89 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 89/89 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 19:45:00] [INFO ] Invariant cache hit.
[2023-03-16 19:45:01] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-16 19:45:01] [INFO ] Invariant cache hit.
[2023-03-16 19:45:01] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:45:01] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-16 19:45:01] [INFO ] Invariant cache hit.
[2023-03-16 19:45:01] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 376 ms. Remains : 89/89 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-5-LTLFireability-12 finished in 3760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
[2023-03-16 19:45:01] [INFO ] Flatten gal took : 19 ms
[2023-03-16 19:45:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 19:45:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 196 places, 196 transitions and 700 arcs took 4 ms.
Total runtime 43829 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2334/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2334/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2334/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2334/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-5-LTLFireability-07
Could not compute solution for formula : ParamProductionCell-PT-5-LTLFireability-09
Could not compute solution for formula : ParamProductionCell-PT-5-LTLFireability-12
Could not compute solution for formula : ParamProductionCell-PT-5-LTLFireability-13

BK_STOP 1678995903097

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name ParamProductionCell-PT-5-LTLFireability-07
ltl formula formula --ltl=/tmp/2334/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 196 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2334/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2334/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2334/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2334/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name ParamProductionCell-PT-5-LTLFireability-09
ltl formula formula --ltl=/tmp/2334/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 196 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2334/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2334/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2334/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2334/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ParamProductionCell-PT-5-LTLFireability-12
ltl formula formula --ltl=/tmp/2334/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 196 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2334/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2334/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2334/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2334/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name ParamProductionCell-PT-5-LTLFireability-13
ltl formula formula --ltl=/tmp/2334/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 196 places, 196 transitions and 700 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2334/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2334/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2334/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2334/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ParamProductionCell-PT-5, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540000404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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