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.r261-smll-167863536300404.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 itstools
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 r261-smll-167863536300404
=====================================================================

--------------------
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 1678920414647

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 22:46:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 22:46:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 22:46:58] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-15 22:46:58] [INFO ] Transformed 231 places.
[2023-03-15 22:46:58] [INFO ] Transformed 202 transitions.
[2023-03-15 22:46:58] [INFO ] Found NUPN structural information;
[2023-03-15 22:46:58] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 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 83 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2023-03-15 22:46:58] [INFO ] Computed 59 place invariants in 26 ms
[2023-03-15 22:46:59] [INFO ] Implicit Places using invariants in 760 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 823 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 22 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 929 ms. Remains : 196/231 places, 196/202 transitions.
Support contains 47 out of 196 places after structural reductions.
[2023-03-15 22:46:59] [INFO ] Flatten gal took : 99 ms
[2023-03-15 22:47:00] [INFO ] Flatten gal took : 34 ms
[2023-03-15 22:47:00] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 26) seen :24
Finished Best-First random walk after 1254 steps, including 0 resets, run visited all 2 properties in 10 ms. (steps per millisecond=125 )
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 12 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-15 22:47:01] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-15 22:47:01] [INFO ] Implicit Places using invariants in 419 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 101, 142]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 434 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 33 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2023-03-15 22:47:01] [INFO ] Computed 20 place invariants in 6 ms
[2023-03-15 22:47:02] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-15 22:47:02] [INFO ] Invariant cache hit.
[2023-03-15 22:47:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:02] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 647 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 1128 ms. Remains : 184/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 357 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 20 reset in 567 ms.
Stack based approach found an accepted trace after 307 steps with 0 reset with depth 308 and stack size 308 in 3 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 2158 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 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 56 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-15 22:47:03] [INFO ] Computed 30 place invariants in 4 ms
[2023-03-15 22:47:03] [INFO ] Implicit Places using invariants in 221 ms returned [14, 19, 22, 39, 50, 53, 65, 67, 97]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 224 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 0 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 25 ms. Remains 101 /118 variables (removed 17) and now considering 110/127 (removed 17) transitions.
// Phase 1: matrix 110 rows 101 cols
[2023-03-15 22:47:03] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:47:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-15 22:47:03] [INFO ] Invariant cache hit.
[2023-03-15 22:47:04] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:04] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 436 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 742 ms. Remains : 101/196 places, 110/196 transitions.
Stuttering acceptance computed with spot in 87 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 264 reset in 383 ms.
Stack based approach found an accepted trace after 165 steps with 4 reset with depth 105 and stack size 105 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-03 finished in 1233 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 5 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-15 22:47:04] [INFO ] Computed 30 place invariants in 6 ms
[2023-03-15 22:47:05] [INFO ] Implicit Places using invariants in 311 ms returned [26, 38, 65, 84, 85, 87, 99, 101, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 312 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-15 22:47:05] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:47:05] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-15 22:47:05] [INFO ] Invariant cache hit.
[2023-03-15 22:47:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:05] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 472 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 797 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 165 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 324 ms.
Product exploration explored 100000 steps with 50000 reset in 500 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 169 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 1998 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 28 ms. Remains 129 /196 variables (removed 67) and now considering 129/196 (removed 67) transitions.
// Phase 1: matrix 129 rows 129 cols
[2023-03-15 22:47:06] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:06] [INFO ] Implicit Places using invariants in 211 ms returned [14, 20, 23, 41, 53, 67, 69, 99]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 213 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 0 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 0 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 15 ms. Remains 106 /121 variables (removed 15) and now considering 114/129 (removed 15) transitions.
// Phase 1: matrix 114 rows 106 cols
[2023-03-15 22:47:06] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-15 22:47:07] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-15 22:47:07] [INFO ] Invariant cache hit.
[2023-03-15 22:47:07] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:07] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 412 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 671 ms. Remains : 106/196 places, 114/196 transitions.
Stuttering acceptance computed with spot in 149 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 131 reset in 193 ms.
Stack based approach found an accepted trace after 125 steps with 0 reset with depth 126 and stack size 126 in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-06 finished in 1033 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 1 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 40 ms. Remains 131 /196 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 131 cols
[2023-03-15 22:47:07] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:07] [INFO ] Implicit Places using invariants in 181 ms returned [15, 20, 23, 40, 53, 54, 56, 68, 70, 100]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 187 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 15 ms. Remains 89 /121 variables (removed 32) and now considering 99/131 (removed 32) transitions.
// Phase 1: matrix 99 rows 89 cols
[2023-03-15 22:47:08] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:47:08] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-15 22:47:08] [INFO ] Invariant cache hit.
[2023-03-15 22:47:08] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:08] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 261 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 505 ms. Remains : 89/196 places, 99/196 transitions.
Stuttering acceptance computed with spot in 175 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 1427 reset in 216 ms.
Product exploration explored 100000 steps with 1427 reset in 270 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 484 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 229 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 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 22:47:09] [INFO ] Invariant cache hit.
[2023-03-15 22:47:09] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-15 22:47:09] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:47:09] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 22:47:09] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-15 22:47:09] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:47:09] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 22:47:09] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:10] [INFO ] After 24ms SMT Verify possible using 66 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 22:47:10] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 6 ms to minimize.
[2023-03-15 22:47:10] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:47:10] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2023-03-15 22:47:10] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2023-03-15 22:47:10] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:47:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 357 ms
[2023-03-15 22:47:10] [INFO ] After 388ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-15 22:47:10] [INFO ] After 563ms 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 623 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 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-15 22:47:11] [INFO ] Invariant cache hit.
[2023-03-15 22:47:11] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-15 22:47:11] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:11] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-15 22:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:47:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-15 22:47:11] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:11] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2023-03-15 22:47:11] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:11] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2023-03-15 22:47:11] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2023-03-15 22:47:11] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-15 22:47:11] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:47:11] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 3 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 2 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-15 22:47:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1136 ms
[2023-03-15 22:47:12] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 13 ms.
[2023-03-15 22:47:13] [INFO ] Added : 74 causal constraints over 15 iterations in 286 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 7 ms. Remains 89 /89 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-15 22:47:13] [INFO ] Invariant cache hit.
[2023-03-15 22:47:13] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-15 22:47:13] [INFO ] Invariant cache hit.
[2023-03-15 22:47:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:13] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-15 22:47:13] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-15 22:47:13] [INFO ] Invariant cache hit.
[2023-03-15 22:47:13] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 646 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 165 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 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
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 192 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 101 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2023-03-15 22:47:14] [INFO ] Invariant cache hit.
[2023-03-15 22:47:14] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-15 22:47:14] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-15 22:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:14] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2023-03-15 22:47:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:47:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-15 22:47:14] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-15 22:47:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:14] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-15 22:47:14] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-15 22:47:14] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2023-03-15 22:47:15] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 989 ms
[2023-03-15 22:47:15] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 22:47:16] [INFO ] Added : 74 causal constraints over 15 iterations in 208 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2347 reset in 229 ms.
Product exploration explored 100000 steps with 2362 reset in 361 ms.
Built C files in :
/tmp/ltsmin5778253532233216199
[2023-03-15 22:47:16] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2023-03-15 22:47:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:47:16] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2023-03-15 22:47:16] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:47:16] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2023-03-15 22:47:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:47:16] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5778253532233216199
Running compilation step : cd /tmp/ltsmin5778253532233216199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 541 ms.
Running link step : cd /tmp/ltsmin5778253532233216199;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin5778253532233216199;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2664949735089982846.hoa' '--buchi-type=spotba'
LTSmin run took 2587 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 12374 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 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-15 22:47:20] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:20] [INFO ] Implicit Places using invariants in 192 ms returned [26, 65, 84, 85, 87, 99, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 194 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-15 22:47:20] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:47:20] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-15 22:47:20] [INFO ] Invariant cache hit.
[2023-03-15 22:47:20] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:20] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 608 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 809 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 221 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 32 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 1049 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-15 22:47:21] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:21] [INFO ] Implicit Places using invariants in 318 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 101]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 320 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-15 22:47:21] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:47:21] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-15 22:47:21] [INFO ] Invariant cache hit.
[2023-03-15 22:47:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:22] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 763 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 1095 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 208 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 424 ms.
Product exploration explored 100000 steps with 25000 reset in 473 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 131 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 272 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 4101 steps, including 1 resets, run visited all 2 properties in 19 ms. (steps per millisecond=215 )
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 194 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 218 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 184 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-15 22:47:24] [INFO ] Invariant cache hit.
[2023-03-15 22:47:24] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-15 22:47:24] [INFO ] Invariant cache hit.
[2023-03-15 22:47:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:25] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2023-03-15 22:47:25] [INFO ] Invariant cache hit.
[2023-03-15 22:47:25] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1227 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 134 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 246 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 4929 steps, including 1 resets, run visited all 2 properties in 38 ms. (steps per millisecond=129 )
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 243 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 193 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 221 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 230 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 327 ms.
Product exploration explored 100000 steps with 25000 reset in 341 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 250 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 1 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 64 ms. Remains 153 /185 variables (removed 32) and now considering 163/194 (removed 31) transitions.
[2023-03-15 22:47:28] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 163 rows 153 cols
[2023-03-15 22:47:28] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-15 22:47:28] [INFO ] Dead Transitions using invariants and state equation in 240 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 324 ms. Remains : 153/185 places, 163/194 transitions.
Built C files in :
/tmp/ltsmin2828801727081047969
[2023-03-15 22:47:28] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2828801727081047969
Running compilation step : cd /tmp/ltsmin2828801727081047969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 733 ms.
Running link step : cd /tmp/ltsmin2828801727081047969;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin2828801727081047969;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18076890284924963812.hoa' '--buchi-type=spotba'
LTSmin run took 85 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 8321 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 28 ms. Remains 127 /196 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 127 cols
[2023-03-15 22:47:29] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:29] [INFO ] Implicit Places using invariants in 264 ms returned [14, 19, 22, 39, 50, 51, 53, 65, 67, 97]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 266 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 18 ms. Remains 84 /117 variables (removed 33) and now considering 94/127 (removed 33) transitions.
// Phase 1: matrix 94 rows 84 cols
[2023-03-15 22:47:29] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 22:47:29] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-15 22:47:29] [INFO ] Invariant cache hit.
[2023-03-15 22:47:30] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:30] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 401 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 716 ms. Remains : 84/196 places, 94/196 transitions.
Stuttering acceptance computed with spot in 50 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 227 ms.
Stack based approach found an accepted trace after 394 steps with 0 reset with depth 395 and stack size 395 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 1015 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 5 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-15 22:47:30] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:30] [INFO ] Implicit Places using invariants in 244 ms returned [26, 34, 38, 65, 84, 85, 99, 101, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 245 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 5 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 255 ms. Remains : 187/196 places, 196/196 transitions.
Stuttering acceptance computed with spot in 115 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 391 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 5 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-15 22:47:30] [INFO ] Invariant cache hit.
[2023-03-15 22:47:31] [INFO ] Implicit Places using invariants in 294 ms returned [26, 34, 38, 65, 84, 85, 87, 99, 142]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 295 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 9 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2023-03-15 22:47:31] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:47:31] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-15 22:47:31] [INFO ] Invariant cache hit.
[2023-03-15 22:47:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:31] [INFO ] Implicit Places using invariants and state equation in 541 ms returned []
Implicit Place search using SMT with State Equation took 729 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 1041 ms. Remains : 185/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 181 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 324 ms.
Product exploration explored 100000 steps with 25000 reset in 356 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 100 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 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 64 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=64 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 152 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 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 309 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 4 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2023-03-15 22:47:33] [INFO ] Invariant cache hit.
[2023-03-15 22:47:33] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-15 22:47:33] [INFO ] Invariant cache hit.
[2023-03-15 22:47:34] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:34] [INFO ] Implicit Places using invariants and state equation in 563 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2023-03-15 22:47:34] [INFO ] Invariant cache hit.
[2023-03-15 22:47:34] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 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 120 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 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 96 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 151 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 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 326 ms.
Product exploration explored 100000 steps with 25000 reset in 313 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 160 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 22 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2023-03-15 22:47:36] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2023-03-15 22:47:36] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-15 22:47:37] [INFO ] Dead Transitions using invariants and state equation in 157 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 193 ms. Remains : 152/185 places, 162/194 transitions.
Built C files in :
/tmp/ltsmin5883504436340154708
[2023-03-15 22:47:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5883504436340154708
Running compilation step : cd /tmp/ltsmin5883504436340154708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 663 ms.
Running link step : cd /tmp/ltsmin5883504436340154708;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5883504436340154708;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10539771229149154933.hoa' '--buchi-type=spotba'
LTSmin run took 168 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-12 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-12 finished in 7020 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 19 ms. Remains 128 /196 variables (removed 68) and now considering 128/196 (removed 68) transitions.
// Phase 1: matrix 128 rows 128 cols
[2023-03-15 22:47:37] [INFO ] Computed 30 place invariants in 0 ms
[2023-03-15 22:47:38] [INFO ] Implicit Places using invariants in 295 ms returned [14, 20, 23, 40, 52, 54, 66, 68, 98]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 296 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 14 ms. Remains 93 /119 variables (removed 26) and now considering 102/128 (removed 26) transitions.
// Phase 1: matrix 102 rows 93 cols
[2023-03-15 22:47:38] [INFO ] Computed 21 place invariants in 0 ms
[2023-03-15 22:47:38] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-15 22:47:38] [INFO ] Invariant cache hit.
[2023-03-15 22:47:38] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:38] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 492 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 822 ms. Remains : 93/196 places, 102/196 transitions.
Stuttering acceptance computed with spot in 158 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 2234 reset in 207 ms.
Product exploration explored 100000 steps with 2240 reset in 239 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 279 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 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 504 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=126 )
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 348 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 162 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-15 22:47:40] [INFO ] Invariant cache hit.
[2023-03-15 22:47:40] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2023-03-15 22:47:40] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:40] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-03-15 22:47:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:47:40] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-15 22:47:40] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-15 22:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:41] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-15 22:47:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:41] [INFO ] [Nat]Added 66 Read/Feed constraints in 17 ms returned sat
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 0 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2023-03-15 22:47:41] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 0 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 4 ms to minimize.
[2023-03-15 22:47:42] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1681 ms
[2023-03-15 22:47:42] [INFO ] Computed and/alt/rep : 99/245/99 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 22:47:43] [INFO ] Added : 79 causal constraints over 16 iterations in 313 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 9 ms. Remains 93 /93 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2023-03-15 22:47:43] [INFO ] Invariant cache hit.
[2023-03-15 22:47:43] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-15 22:47:43] [INFO ] Invariant cache hit.
[2023-03-15 22:47:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:43] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2023-03-15 22:47:43] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 22:47:43] [INFO ] Invariant cache hit.
[2023-03-15 22:47:43] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 680 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 337 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 166 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 731 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=146 )
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 231 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 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-15 22:47:44] [INFO ] Invariant cache hit.
[2023-03-15 22:47:44] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-15 22:47:44] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:45] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-15 22:47:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 22:47:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2023-03-15 22:47:45] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-15 22:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 22:47:45] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-03-15 22:47:45] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-15 22:47:45] [INFO ] [Nat]Added 66 Read/Feed constraints in 18 ms returned sat
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:47:45] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 4 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-15 22:47:46] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 1612 ms
[2023-03-15 22:47:46] [INFO ] Computed and/alt/rep : 99/245/99 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-15 22:47:47] [INFO ] Added : 79 causal constraints over 16 iterations in 194 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2223 reset in 120 ms.
Product exploration explored 100000 steps with 2222 reset in 158 ms.
Built C files in :
/tmp/ltsmin129312271203092934
[2023-03-15 22:47:47] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2023-03-15 22:47:47] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:47:47] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2023-03-15 22:47:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:47:47] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2023-03-15 22:47:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 22:47:47] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin129312271203092934
Running compilation step : cd /tmp/ltsmin129312271203092934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 494 ms.
Running link step : cd /tmp/ltsmin129312271203092934;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin129312271203092934;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14119295548214410716.hoa' '--buchi-type=spotba'
LTSmin run took 1075 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 11258 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 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-15 22:47:49] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-15 22:47:49] [INFO ] Implicit Places using invariants in 172 ms returned [26, 34, 38, 65, 84, 87, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 174 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-15 22:47:49] [INFO ] Computed 22 place invariants in 0 ms
[2023-03-15 22:47:49] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-15 22:47:49] [INFO ] Invariant cache hit.
[2023-03-15 22:47:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:50] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 739 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 921 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 346 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 119 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 1328 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 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-15 22:47:50] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 22:47:50] [INFO ] Implicit Places using invariants in 307 ms returned [34, 38, 84, 85, 87, 99, 101, 142]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 309 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-15 22:47:50] [INFO ] Computed 22 place invariants in 2 ms
[2023-03-15 22:47:51] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-15 22:47:51] [INFO ] Invariant cache hit.
[2023-03-15 22:47:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-15 22:47:51] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 691 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 1012 ms. Remains : 186/196 places, 194/196 transitions.
Stuttering acceptance computed with spot in 277 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 5078 steps with 2 reset in 9 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 1324 ms.
All properties solved by simple procedures.
Total runtime 53883 ms.

BK_STOP 1678920473129

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r261-smll-167863536300404"
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 ;