Execution Chart

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

Trace from the execution

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

--------------------
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-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-5-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678995819559

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 19:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 19:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:43:42] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2023-03-16 19:43:42] [INFO ] Transformed 231 places.
[2023-03-16 19:43:42] [INFO ] Transformed 202 transitions.
[2023-03-16 19:43:42] [INFO ] Found NUPN structural information;
[2023-03-16 19:43:42] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 57 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2023-03-16 19:43:42] [INFO ] Computed 59 place invariants in 16 ms
[2023-03-16 19:43:43] [INFO ] Implicit Places using invariants in 552 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 41, 42, 59, 64, 65, 73, 79, 98, 99, 101, 114, 115, 117, 119, 120, 160, 161, 163, 165, 166, 191, 192, 195, 196, 201, 206, 217]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 595 ms to find 35 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 191/231 places, 197/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 189 transition count 195
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 189 transition count 195
Applied a total of 4 rules in 22 ms. Remains 189 /191 variables (removed 2) and now considering 195/197 (removed 2) transitions.
// Phase 1: matrix 195 rows 189 cols
[2023-03-16 19:43:43] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-16 19:43:43] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-16 19:43:43] [INFO ] Invariant cache hit.
[2023-03-16 19:43:43] [INFO ] State equation strengthened by 68 read => feed constraints.
[2023-03-16 19:43:43] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 189/231 places, 195/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1194 ms. Remains : 189/231 places, 195/202 transitions.
Support contains 27 out of 189 places after structural reductions.
[2023-03-16 19:43:43] [INFO ] Flatten gal took : 57 ms
[2023-03-16 19:43:43] [INFO ] Flatten gal took : 22 ms
[2023-03-16 19:43:44] [INFO ] Input system was already deterministic with 195 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=23 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 19:43:44] [INFO ] Invariant cache hit.
[2023-03-16 19:43:44] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 19:43:44] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-16 19:43:44] [INFO ] [Nat]Absence check using 20 positive and 4 generalized place invariants in 7 ms returned sat
[2023-03-16 19:43:44] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 16 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-16 19:43:45] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-16 19:43:45] [INFO ] Implicit Places using invariants in 181 ms returned [37, 64, 166]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 183 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 194/195 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 205 ms. Remains : 185/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s36 0) (EQ s53 1) (NEQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 487 ms.
Product exploration explored 100000 steps with 50000 reset in 361 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLCardinality-01 finished in 1434 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 161
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 161
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 68 place count 155 transition count 145
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 100 place count 139 transition count 145
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 180 place count 99 transition count 105
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 184 place count 97 transition count 103
Applied a total of 184 rules in 35 ms. Remains 97 /189 variables (removed 92) and now considering 103/195 (removed 92) transitions.
// Phase 1: matrix 103 rows 97 cols
[2023-03-16 19:43:46] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 19:43:46] [INFO ] Implicit Places using invariants in 121 ms returned [18, 19, 37, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 122 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 103/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 93 transition count 101
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 91 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 85 transition count 95
Applied a total of 16 rules in 10 ms. Remains 85 /93 variables (removed 8) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 19:43:46] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:43:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-16 19:43:46] [INFO ] Invariant cache hit.
[2023-03-16 19:43:46] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:46] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/189 places, 95/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 456 ms. Remains : 85/189 places, 95/195 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s25 0) (EQ s40 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 179 ms.
Stack based approach found an accepted trace after 179 steps with 0 reset with depth 180 and stack size 180 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-02 finished in 695 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 161
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 161
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 68 place count 155 transition count 144
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 102 place count 138 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 103 place count 137 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 104 place count 137 transition count 143
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 176 place count 101 transition count 107
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 180 place count 99 transition count 105
Applied a total of 180 rules in 33 ms. Remains 99 /189 variables (removed 90) and now considering 105/195 (removed 90) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-16 19:43:47] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-16 19:43:47] [INFO ] Implicit Places using invariants in 110 ms returned [18, 19, 37]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 113 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 105/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 96 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 94 transition count 103
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 12 place count 90 transition count 99
Applied a total of 12 rules in 8 ms. Remains 90 /96 variables (removed 6) and now considering 99/105 (removed 6) transitions.
// Phase 1: matrix 99 rows 90 cols
[2023-03-16 19:43:47] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-16 19:43:47] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-16 19:43:47] [INFO ] Invariant cache hit.
[2023-03-16 19:43:47] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:47] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/189 places, 99/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 427 ms. Remains : 90/189 places, 99/195 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s42 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 5701 reset in 167 ms.
Product exploration explored 100000 steps with 5701 reset in 267 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
[2023-03-16 19:43:48] [INFO ] Invariant cache hit.
[2023-03-16 19:43:48] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 19:43:48] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 19:43:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:48] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-16 19:43:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:43:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 19:43:48] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-16 19:43:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:49] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-16 19:43:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:49] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2023-03-16 19:43:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2023-03-16 19:43:50] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-16 19:43:50] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2023-03-16 19:43:50] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 1013 ms
[2023-03-16 19:43:50] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 19:43:50] [INFO ] Added : 63 causal constraints over 13 iterations in 185 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-16 19:43:50] [INFO ] Invariant cache hit.
[2023-03-16 19:43:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-16 19:43:50] [INFO ] Invariant cache hit.
[2023-03-16 19:43:50] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:50] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-16 19:43:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:43:50] [INFO ] Invariant cache hit.
[2023-03-16 19:43:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 90/90 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2023-03-16 19:43:51] [INFO ] Invariant cache hit.
[2023-03-16 19:43:51] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2023-03-16 19:43:51] [INFO ] [Real]Absence check using 19 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 19:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:51] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-16 19:43:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:43:51] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-03-16 19:43:51] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 19:43:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:51] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-16 19:43:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2023-03-16 19:43:51] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 5 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2023-03-16 19:43:52] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 988 ms
[2023-03-16 19:43:52] [INFO ] Computed and/alt/rep : 96/220/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-16 19:43:52] [INFO ] Added : 63 causal constraints over 13 iterations in 165 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5720 reset in 195 ms.
Product exploration explored 100000 steps with 5739 reset in 189 ms.
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-16 19:43:53] [INFO ] Invariant cache hit.
[2023-03-16 19:43:53] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-16 19:43:53] [INFO ] Invariant cache hit.
[2023-03-16 19:43:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:53] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-16 19:43:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:43:53] [INFO ] Invariant cache hit.
[2023-03-16 19:43:53] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 413 ms. Remains : 90/90 places, 99/99 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-03 finished in 6342 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 189 transition count 161
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 155 transition count 161
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 68 place count 155 transition count 146
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 98 place count 140 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 139 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 139 transition count 145
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 176 place count 101 transition count 107
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 180 place count 99 transition count 105
Applied a total of 180 rules in 25 ms. Remains 99 /189 variables (removed 90) and now considering 105/195 (removed 90) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-16 19:43:53] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 19:43:53] [INFO ] Implicit Places using invariants in 93 ms returned [19, 20, 38, 89]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 105/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 95 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 87 transition count 97
Applied a total of 16 rules in 10 ms. Remains 87 /95 variables (removed 8) and now considering 97/105 (removed 8) transitions.
// Phase 1: matrix 97 rows 87 cols
[2023-03-16 19:43:53] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:43:53] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-16 19:43:53] [INFO ] Invariant cache hit.
[2023-03-16 19:43:53] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:53] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/189 places, 97/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 402 ms. Remains : 87/189 places, 97/195 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s55 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 142 ms.
Stack based approach found an accepted trace after 98 steps with 0 reset with depth 99 and stack size 99 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-04 finished in 594 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 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 8 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-16 19:43:54] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-16 19:43:54] [INFO ] Implicit Places using invariants in 115 ms returned [36, 37, 64, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 116 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/195 transitions.
Applied a total of 0 rules in 4 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 184/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-06 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 s180 0) (EQ s61 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 42 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-06 finished in 227 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 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 9 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
[2023-03-16 19:43:54] [INFO ] Invariant cache hit.
[2023-03-16 19:43:54] [INFO ] Implicit Places using invariants in 148 ms returned [36, 37, 64, 166]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 149 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/189 places, 194/195 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 164 ms. Remains : 184/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-07 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:(AND (EQ s43 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 418 reset in 130 ms.
Stack based approach found an accepted trace after 290 steps with 0 reset with depth 291 and stack size 291 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-07 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 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 189 transition count 163
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 157 transition count 163
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 64 place count 157 transition count 146
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 98 place count 140 transition count 146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 99 place count 139 transition count 145
Iterating global reduction 2 with 1 rules applied. Total rules applied 100 place count 139 transition count 145
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 176 place count 101 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 178 place count 100 transition count 106
Applied a total of 178 rules in 23 ms. Remains 100 /189 variables (removed 89) and now considering 106/195 (removed 89) transitions.
// Phase 1: matrix 106 rows 100 cols
[2023-03-16 19:43:54] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 19:43:54] [INFO ] Implicit Places using invariants in 95 ms returned [20, 21, 41, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 96 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/189 places, 106/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 96 transition count 104
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 94 transition count 104
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 88 transition count 98
Applied a total of 16 rules in 10 ms. Remains 88 /96 variables (removed 8) and now considering 98/106 (removed 8) transitions.
// Phase 1: matrix 98 rows 88 cols
[2023-03-16 19:43:54] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:43:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-16 19:43:55] [INFO ] Invariant cache hit.
[2023-03-16 19:43:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 19:43:55] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/189 places, 98/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 416 ms. Remains : 88/189 places, 98/195 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 0) (EQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 24730 reset in 148 ms.
Product exploration explored 100000 steps with 24972 reset in 168 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 136 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-16 19:43:56] [INFO ] Invariant cache hit.
[2023-03-16 19:43:56] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 19:43:56] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-16 19:43:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:56] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-16 19:43:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:43:56] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 19:43:56] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-16 19:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:56] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-16 19:43:56] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 19:43:56] [INFO ] [Nat]Added 67 Read/Feed constraints in 10 ms returned sat
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 0 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2023-03-16 19:43:56] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 362 ms
[2023-03-16 19:43:56] [INFO ] Computed and/alt/rep : 95/220/95 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-16 19:43:56] [INFO ] Added : 82 causal constraints over 17 iterations in 204 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 19:43:56] [INFO ] Invariant cache hit.
[2023-03-16 19:43:56] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-16 19:43:56] [INFO ] Invariant cache hit.
[2023-03-16 19:43:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 19:43:57] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-16 19:43:57] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 19:43:57] [INFO ] Invariant cache hit.
[2023-03-16 19:43:57] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 88/88 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-16 19:43:57] [INFO ] Invariant cache hit.
[2023-03-16 19:43:57] [INFO ] [Real]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 19:43:57] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-16 19:43:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:57] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-16 19:43:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 19:43:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2023-03-16 19:43:57] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-16 19:43:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 19:43:58] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-16 19:43:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 19:43:58] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 3 ms to minimize.
[2023-03-16 19:43:58] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 343 ms
[2023-03-16 19:43:58] [INFO ] Computed and/alt/rep : 95/220/95 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-16 19:43:58] [INFO ] Added : 82 causal constraints over 17 iterations in 206 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 122 ms :[(NOT p0)]
Product exploration explored 100000 steps with 24795 reset in 146 ms.
Product exploration explored 100000 steps with 25024 reset in 190 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2023-03-16 19:43:59] [INFO ] Invariant cache hit.
[2023-03-16 19:43:59] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-16 19:43:59] [INFO ] Invariant cache hit.
[2023-03-16 19:43:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-16 19:43:59] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-16 19:43:59] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-16 19:43:59] [INFO ] Invariant cache hit.
[2023-03-16 19:43:59] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 408 ms. Remains : 88/88 places, 98/98 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-09 finished in 4621 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 1 out of 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 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 189 transition count 162
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 156 transition count 162
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 66 place count 156 transition count 145
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 100 place count 139 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 138 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 138 transition count 144
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 180 place count 99 transition count 105
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 184 place count 97 transition count 103
Applied a total of 184 rules in 18 ms. Remains 97 /189 variables (removed 92) and now considering 103/195 (removed 92) transitions.
// Phase 1: matrix 103 rows 97 cols
[2023-03-16 19:43:59] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 19:43:59] [INFO ] Implicit Places using invariants in 108 ms returned [18, 19, 38, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 110 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/189 places, 103/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 93 transition count 101
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 91 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 85 transition count 95
Applied a total of 16 rules in 7 ms. Remains 85 /93 variables (removed 8) and now considering 95/103 (removed 8) transitions.
// Phase 1: matrix 95 rows 85 cols
[2023-03-16 19:43:59] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-16 19:43:59] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-16 19:43:59] [INFO ] Invariant cache hit.
[2023-03-16 19:43:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:43:59] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/189 places, 95/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 400 ms. Remains : 85/189 places, 95/195 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-10 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:(NEQ s26 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 1798 reset in 131 ms.
Product exploration explored 100000 steps with 1795 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 26 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=26 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-16 19:44:00] [INFO ] Invariant cache hit.
[2023-03-16 19:44:00] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-16 19:44:00] [INFO ] Invariant cache hit.
[2023-03-16 19:44:00] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:00] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-16 19:44:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:44:00] [INFO ] Invariant cache hit.
[2023-03-16 19:44:01] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 85/85 places, 95/95 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1860 reset in 131 ms.
Product exploration explored 100000 steps with 1847 reset in 150 ms.
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 85/85 places, 95/95 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-16 19:44:01] [INFO ] Invariant cache hit.
[2023-03-16 19:44:01] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-16 19:44:01] [INFO ] Invariant cache hit.
[2023-03-16 19:44:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:02] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-16 19:44:02] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-16 19:44:02] [INFO ] Invariant cache hit.
[2023-03-16 19:44:02] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 398 ms. Remains : 85/85 places, 95/95 transitions.
Treatment of property ParamProductionCell-PT-5-LTLCardinality-10 finished in 2810 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((p0||F(p1)||(X((!p3 U (p4||G(!p3))))&&p2))))'
Support contains 5 out of 189 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 195/195 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 188 transition count 194
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 188 transition count 194
Applied a total of 2 rules in 4 ms. Remains 188 /189 variables (removed 1) and now considering 194/195 (removed 1) transitions.
// Phase 1: matrix 194 rows 188 cols
[2023-03-16 19:44:02] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 19:44:02] [INFO ] Implicit Places using invariants in 112 ms returned [36, 37, 166]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/189 places, 194/195 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 122 ms. Remains : 185/189 places, 194/195 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) p3 (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p4) p3)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s160 0) (EQ s173 1)), p0:(EQ s77 0), p2:(AND (NEQ s62 0) (NEQ s6 1)), p4:(NEQ s77 1), p3:(OR (EQ s62 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 222 ms.
Product exploration explored 100000 steps with 50000 reset in 245 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 (NOT p2) p4 p3), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p4) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 4 states, 6 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-5-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-5-LTLCardinality-12 finished in 931 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 189 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 189/189 places, 195/195 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 189 transition count 164
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 158 transition count 163
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 157 transition count 163
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 64 place count 157 transition count 145
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 100 place count 139 transition count 145
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 101 place count 138 transition count 144
Iterating global reduction 3 with 1 rules applied. Total rules applied 102 place count 138 transition count 144
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 176 place count 101 transition count 107
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 180 place count 99 transition count 105
Applied a total of 180 rules in 18 ms. Remains 99 /189 variables (removed 90) and now considering 105/195 (removed 90) transitions.
// Phase 1: matrix 105 rows 99 cols
[2023-03-16 19:44:03] [INFO ] Computed 24 place invariants in 1 ms
[2023-03-16 19:44:03] [INFO ] Implicit Places using invariants in 97 ms returned [19, 20, 38, 87]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 100 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 95/189 places, 105/195 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 95 transition count 103
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 93 transition count 103
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 87 transition count 97
Applied a total of 16 rules in 7 ms. Remains 87 /95 variables (removed 8) and now considering 97/105 (removed 8) transitions.
// Phase 1: matrix 97 rows 87 cols
[2023-03-16 19:44:03] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-16 19:44:03] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-16 19:44:03] [INFO ] Invariant cache hit.
[2023-03-16 19:44:03] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-16 19:44:03] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/189 places, 97/195 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 87/189 places, 97/195 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLCardinality-15 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 s9 0) (EQ s82 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 3704 reset in 131 ms.
Stack based approach found an accepted trace after 3212 steps with 137 reset with depth 112 and stack size 112 in 6 ms.
FORMULA ParamProductionCell-PT-5-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLCardinality-15 finished in 666 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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-16 19:44:04] [INFO ] Flatten gal took : 15 ms
[2023-03-16 19:44:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-16 19:44:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 195 transitions and 610 arcs took 3 ms.
Total runtime 22280 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1253/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1253/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1253/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ParamProductionCell-PT-5-LTLCardinality-03
Could not compute solution for formula : ParamProductionCell-PT-5-LTLCardinality-09
Could not compute solution for formula : ParamProductionCell-PT-5-LTLCardinality-10

BK_STOP 1678995845708

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x5567e39b63f4]
1: pnml2lts-mc(+0xa2496) [0x5567e39b6496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe862c5b140]
3: pnml2lts-mc(+0x405be5) [0x5567e3d19be5]
4: pnml2lts-mc(+0x16b3f9) [0x5567e3a7f3f9]
5: pnml2lts-mc(+0x164ac4) [0x5567e3a78ac4]
6: pnml2lts-mc(+0x272e0a) [0x5567e3b86e0a]
7: pnml2lts-mc(+0xb61f0) [0x5567e39ca1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe862aae4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe862aae67a]
10: pnml2lts-mc(+0xa1581) [0x5567e39b5581]
11: pnml2lts-mc(+0xa1910) [0x5567e39b5910]
12: pnml2lts-mc(+0xa32a2) [0x5567e39b72a2]
13: pnml2lts-mc(+0xa50f4) [0x5567e39b90f4]
14: pnml2lts-mc(+0xa516b) [0x5567e39b916b]
15: pnml2lts-mc(+0x3f34b3) [0x5567e3d074b3]
16: pnml2lts-mc(+0x7c63d) [0x5567e399063d]
17: pnml2lts-mc(+0x67d86) [0x5567e397bd86]
18: pnml2lts-mc(+0x60a8a) [0x5567e3974a8a]
19: pnml2lts-mc(+0x5eb15) [0x5567e3972b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe862a96d0a]
21: pnml2lts-mc(+0x6075e) [0x5567e397475e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ParamProductionCell-PT-5, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540000403"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;