Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694700419.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q8m032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 06:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 06:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 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 BugTracking-PT-q8m032-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678635665138

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=BugTracking-PT-q8m032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:41:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:41:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:41:07] [INFO ] Load time of PNML (sax parser for PT used): 710 ms
[2023-03-12 15:41:07] [INFO ] Transformed 754 places.
[2023-03-12 15:41:07] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:41:07] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 917 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 474 places in 99 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Applied a total of 2 rules in 60 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2023-03-12 15:41:08] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2023-03-12 15:41:08] [INFO ] Computed 8 place invariants in 51 ms
[2023-03-12 15:41:08] [INFO ] Implicit Places using invariants in 691 ms returned []
[2023-03-12 15:41:08] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-12 15:41:08] [INFO ] Invariant cache hit.
[2023-03-12 15:41:09] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:41:11] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 3047 ms to find 0 implicit places.
[2023-03-12 15:41:11] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-12 15:41:11] [INFO ] Invariant cache hit.
[2023-03-12 15:41:12] [INFO ] Dead Transitions using invariants and state equation in 1219 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3904/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4329 ms. Remains : 278/280 places, 3904/3904 transitions.
Support contains 7 out of 278 places after structural reductions.
[2023-03-12 15:41:12] [INFO ] Flatten gal took : 333 ms
[2023-03-12 15:41:13] [INFO ] Flatten gal took : 194 ms
[2023-03-12 15:41:13] [INFO ] Input system was already deterministic with 3904 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 113034 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113034 steps, saw 57411 distinct states, run finished after 3012 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 15:41:17] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-12 15:41:17] [INFO ] Invariant cache hit.
[2023-03-12 15:41:17] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:41:17] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 15:41:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:41:18] [INFO ] After 1016ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 15:41:18] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:41:19] [INFO ] After 1036ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 15:41:19] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 6 ms to minimize.
[2023-03-12 15:41:20] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2023-03-12 15:41:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 705 ms
[2023-03-12 15:41:21] [INFO ] Deduced a trap composed of 12 places in 496 ms of which 2 ms to minimize.
[2023-03-12 15:41:21] [INFO ] Deduced a trap composed of 38 places in 466 ms of which 1 ms to minimize.
[2023-03-12 15:41:26] [INFO ] Deduced a trap composed of 26 places in 4369 ms of which 26 ms to minimize.
[2023-03-12 15:41:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5736 ms
[2023-03-12 15:41:26] [INFO ] Deduced a trap composed of 76 places in 481 ms of which 0 ms to minimize.
[2023-03-12 15:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 682 ms
[2023-03-12 15:41:27] [INFO ] After 8958ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 865 ms.
[2023-03-12 15:41:28] [INFO ] After 10961ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 204 ms.
Support contains 7 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 3908
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 277 transition count 3901
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 270 transition count 3901
Applied a total of 16 rules in 252 ms. Remains 270 /278 variables (removed 8) and now considering 3901/3904 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 270/278 places, 3901/3904 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 97878 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 97878 steps, saw 63945 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 15:41:31] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
// Phase 1: matrix 3721 rows 270 cols
[2023-03-12 15:41:31] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-12 15:41:32] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:41:32] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 15:41:32] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:41:32] [INFO ] After 772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 15:41:32] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:41:33] [INFO ] After 559ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 15:41:33] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2023-03-12 15:41:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 169 ms
[2023-03-12 15:41:34] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 0 ms to minimize.
[2023-03-12 15:41:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2023-03-12 15:41:34] [INFO ] After 1646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 491 ms.
[2023-03-12 15:41:35] [INFO ] After 2989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 6 ms.
Support contains 7 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3901/3901 transitions.
Applied a total of 0 rules in 63 ms. Remains 270 /270 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 270/270 places, 3901/3901 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3901/3901 transitions.
Applied a total of 0 rules in 65 ms. Remains 270 /270 variables (removed 0) and now considering 3901/3901 (removed 0) transitions.
[2023-03-12 15:41:35] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
[2023-03-12 15:41:35] [INFO ] Invariant cache hit.
[2023-03-12 15:41:35] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-12 15:41:35] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
[2023-03-12 15:41:35] [INFO ] Invariant cache hit.
[2023-03-12 15:41:36] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:41:37] [INFO ] Implicit Places using invariants and state equation in 2065 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
[2023-03-12 15:41:37] [INFO ] Redundant transitions in 315 ms returned []
[2023-03-12 15:41:38] [INFO ] Flow matrix only has 3721 transitions (discarded 180 similar events)
[2023-03-12 15:41:38] [INFO ] Invariant cache hit.
[2023-03-12 15:41:39] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3959 ms. Remains : 270/270 places, 3901/3901 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 175 transitions
Reduce isomorphic transitions removed 181 transitions.
Iterating post reduction 0 with 181 rules applied. Total rules applied 181 place count 270 transition count 3720
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 1 with 4 rules applied. Total rules applied 185 place count 268 transition count 3718
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 189 place count 268 transition count 3714
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 193 place count 264 transition count 3714
Applied a total of 193 rules in 191 ms. Remains 264 /270 variables (removed 6) and now considering 3714/3901 (removed 187) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 3714 rows 264 cols
[2023-03-12 15:41:39] [INFO ] Computed 9 place invariants in 21 ms
[2023-03-12 15:41:39] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 15:41:39] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 15:41:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:41:40] [INFO ] After 827ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 15:41:40] [INFO ] After 1431ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-12 15:41:41] [INFO ] After 1838ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 275 transition count 3877
Applied a total of 6 rules in 254 ms. Remains 275 /278 variables (removed 3) and now considering 3877/3904 (removed 27) transitions.
[2023-03-12 15:41:41] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:41:41] [INFO ] Computed 8 place invariants in 34 ms
[2023-03-12 15:41:42] [INFO ] Implicit Places using invariants in 589 ms returned []
[2023-03-12 15:41:42] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:41:42] [INFO ] Invariant cache hit.
[2023-03-12 15:41:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:41:44] [INFO ] Implicit Places using invariants and state equation in 1943 ms returned []
Implicit Place search using SMT with State Equation took 2548 ms to find 0 implicit places.
[2023-03-12 15:41:44] [INFO ] Redundant transitions in 209 ms returned []
[2023-03-12 15:41:44] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:41:44] [INFO ] Invariant cache hit.
[2023-03-12 15:41:45] [INFO ] Dead Transitions using invariants and state equation in 1178 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/278 places, 3877/3904 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4204 ms. Remains : 275/278 places, 3877/3904 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m032-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:(LEQ 1 s102)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 507 steps with 0 reset in 27 ms.
FORMULA BugTracking-PT-q8m032-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m032-LTLCardinality-02 finished in 4562 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 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 52 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 15:41:45] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:41:46] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:41:46] [INFO ] Implicit Places using invariants in 457 ms returned []
[2023-03-12 15:41:46] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:41:46] [INFO ] Invariant cache hit.
[2023-03-12 15:41:47] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:41:48] [INFO ] Implicit Places using invariants and state equation in 2088 ms returned []
Implicit Place search using SMT with State Equation took 2552 ms to find 0 implicit places.
[2023-03-12 15:41:48] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:41:48] [INFO ] Invariant cache hit.
[2023-03-12 15:41:49] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/278 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3697 ms. Remains : 277/278 places, 3871/3904 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m032-LTLCardinality-05 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:(LEQ s191 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 181 reset in 741 ms.
Product exploration explored 100000 steps with 167 reset in 718 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10026 steps, including 19 resets, run finished after 39 ms. (steps per millisecond=257 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 162028 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 162028 steps, saw 82462 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:41:54] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:41:54] [INFO ] Invariant cache hit.
[2023-03-12 15:41:54] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:41:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:41:55] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:41:55] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:41:55] [INFO ] After 259ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:41:56] [INFO ] Deduced a trap composed of 17 places in 494 ms of which 0 ms to minimize.
[2023-03-12 15:41:56] [INFO ] Deduced a trap composed of 70 places in 506 ms of which 1 ms to minimize.
[2023-03-12 15:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1326 ms
[2023-03-12 15:41:57] [INFO ] After 1666ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-12 15:41:57] [INFO ] After 2531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 297 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 149765 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 149765 steps, saw 62795 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:42:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:42:00] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-12 15:42:00] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:42:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:42:01] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:01] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:42:01] [INFO ] After 294ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:02] [INFO ] Deduced a trap composed of 19 places in 553 ms of which 0 ms to minimize.
[2023-03-12 15:42:04] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2023-03-12 15:42:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2652 ms
[2023-03-12 15:42:04] [INFO ] After 3002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-12 15:42:04] [INFO ] After 3787ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 99 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 75 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:42:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:42:04] [INFO ] Invariant cache hit.
[2023-03-12 15:42:04] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-12 15:42:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:42:04] [INFO ] Invariant cache hit.
[2023-03-12 15:42:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:42:06] [INFO ] Implicit Places using invariants and state equation in 1969 ms returned []
Implicit Place search using SMT with State Equation took 2357 ms to find 0 implicit places.
[2023-03-12 15:42:07] [INFO ] Redundant transitions in 195 ms returned []
[2023-03-12 15:42:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:42:07] [INFO ] Invariant cache hit.
[2023-03-12 15:42:08] [INFO ] Dead Transitions using invariants and state equation in 1106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3748 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 377 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:42:08] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-12 15:42:08] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:42:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:42:09] [INFO ] After 483ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:09] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 15:42:09] [INFO ] After 719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:42:09] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:42:09] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:42:10] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-12 15:42:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:10] [INFO ] Invariant cache hit.
[2023-03-12 15:42:10] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:42:12] [INFO ] Implicit Places using invariants and state equation in 1661 ms returned []
Implicit Place search using SMT with State Equation took 2201 ms to find 0 implicit places.
[2023-03-12 15:42:12] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:12] [INFO ] Invariant cache hit.
[2023-03-12 15:42:13] [INFO ] Dead Transitions using invariants and state equation in 1120 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3363 ms. Remains : 277/277 places, 3871/3871 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10029 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167729 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167729 steps, saw 85359 distinct states, run finished after 3005 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:42:16] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:16] [INFO ] Invariant cache hit.
[2023-03-12 15:42:16] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:42:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:42:17] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:17] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:42:17] [INFO ] After 297ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:18] [INFO ] Deduced a trap composed of 17 places in 552 ms of which 1 ms to minimize.
[2023-03-12 15:42:18] [INFO ] Deduced a trap composed of 70 places in 436 ms of which 0 ms to minimize.
[2023-03-12 15:42:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1183 ms
[2023-03-12 15:42:18] [INFO ] After 1519ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-12 15:42:18] [INFO ] After 2250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 132 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10021 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154510 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154510 steps, saw 65975 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:42:22] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:42:22] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-12 15:42:22] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:42:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:42:22] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:22] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:42:23] [INFO ] After 309ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:23] [INFO ] Deduced a trap composed of 19 places in 477 ms of which 1 ms to minimize.
[2023-03-12 15:42:26] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-12 15:42:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3000 ms
[2023-03-12 15:42:26] [INFO ] After 3393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 15:42:26] [INFO ] After 4171ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 65 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:42:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:42:26] [INFO ] Invariant cache hit.
[2023-03-12 15:42:26] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-12 15:42:26] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:42:26] [INFO ] Invariant cache hit.
[2023-03-12 15:42:27] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:42:28] [INFO ] Implicit Places using invariants and state equation in 2088 ms returned []
Implicit Place search using SMT with State Equation took 2554 ms to find 0 implicit places.
[2023-03-12 15:42:29] [INFO ] Redundant transitions in 153 ms returned []
[2023-03-12 15:42:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:42:29] [INFO ] Invariant cache hit.
[2023-03-12 15:42:30] [INFO ] Dead Transitions using invariants and state equation in 1506 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4288 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 242 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:42:30] [INFO ] Computed 9 place invariants in 18 ms
[2023-03-12 15:42:30] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:42:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:42:31] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:31] [INFO ] After 718ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-12 15:42:31] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 149 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 172 reset in 727 ms.
Product exploration explored 100000 steps with 184 reset in 752 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 3881
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 2 rules in 141 ms. Remains 277 /277 variables (removed 0) and now considering 3881/3871 (removed -10) transitions.
[2023-03-12 15:42:34] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-12 15:42:34] [INFO ] Flow matrix only has 3709 transitions (discarded 172 similar events)
// Phase 1: matrix 3709 rows 277 cols
[2023-03-12 15:42:34] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 15:42:35] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/277 places, 3881/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1317 ms. Remains : 277/277 places, 3881/3871 transitions.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 12 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:42:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:42:35] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:42:35] [INFO ] Implicit Places using invariants in 480 ms returned []
[2023-03-12 15:42:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:35] [INFO ] Invariant cache hit.
[2023-03-12 15:42:36] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:42:37] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2118 ms to find 0 implicit places.
[2023-03-12 15:42:37] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:37] [INFO ] Invariant cache hit.
[2023-03-12 15:42:38] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3008 ms. Remains : 277/277 places, 3871/3871 transitions.
Treatment of property BugTracking-PT-q8m032-LTLCardinality-05 finished in 52696 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((p0&&F(p1))))))'
Support contains 3 out of 278 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 40 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 15:42:38] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:38] [INFO ] Invariant cache hit.
[2023-03-12 15:42:39] [INFO ] Implicit Places using invariants in 381 ms returned []
[2023-03-12 15:42:39] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:39] [INFO ] Invariant cache hit.
[2023-03-12 15:42:39] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:42:40] [INFO ] Implicit Places using invariants and state equation in 1776 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2023-03-12 15:42:40] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:42:40] [INFO ] Invariant cache hit.
[2023-03-12 15:42:41] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/278 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3373 ms. Remains : 277/278 places, 3871/3904 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BugTracking-PT-q8m032-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(LEQ s118 s110), p0:(LEQ 1 s153)], 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BugTracking-PT-q8m032-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m032-LTLCardinality-07 finished in 3601 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 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 277 transition count 3908
Applied a total of 2 rules in 103 ms. Remains 277 /278 variables (removed 1) and now considering 3908/3904 (removed -4) transitions.
[2023-03-12 15:42:42] [INFO ] Flow matrix only has 3728 transitions (discarded 180 similar events)
// Phase 1: matrix 3728 rows 277 cols
[2023-03-12 15:42:42] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:42:42] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-12 15:42:42] [INFO ] Flow matrix only has 3728 transitions (discarded 180 similar events)
[2023-03-12 15:42:42] [INFO ] Invariant cache hit.
[2023-03-12 15:42:43] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-12 15:42:44] [INFO ] Implicit Places using invariants and state equation in 1937 ms returned []
Implicit Place search using SMT with State Equation took 2381 ms to find 0 implicit places.
[2023-03-12 15:42:44] [INFO ] Redundant transitions in 153 ms returned []
[2023-03-12 15:42:44] [INFO ] Flow matrix only has 3728 transitions (discarded 180 similar events)
[2023-03-12 15:42:44] [INFO ] Invariant cache hit.
[2023-03-12 15:42:46] [INFO ] Dead Transitions using invariants and state equation in 1162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 277/278 places, 3908/3904 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3827 ms. Remains : 277/278 places, 3908/3904 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m032-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s123 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 462 steps with 0 reset in 3 ms.
FORMULA BugTracking-PT-q8m032-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m032-LTLCardinality-13 finished in 3876 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)))'
Found a Lengthening insensitive property : BugTracking-PT-q8m032-LTLCardinality-05
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 275 transition count 3877
Applied a total of 6 rules in 65 ms. Remains 275 /278 variables (removed 3) and now considering 3877/3904 (removed 27) transitions.
[2023-03-12 15:42:46] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:42:46] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-12 15:42:46] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-12 15:42:46] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:42:46] [INFO ] Invariant cache hit.
[2023-03-12 15:42:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:42:48] [INFO ] Implicit Places using invariants and state equation in 2199 ms returned []
Implicit Place search using SMT with State Equation took 2684 ms to find 0 implicit places.
[2023-03-12 15:42:48] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:42:48] [INFO ] Invariant cache hit.
[2023-03-12 15:42:49] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 275/278 places, 3877/3904 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 3643 ms. Remains : 275/278 places, 3877/3904 transitions.
Running random walk in product with property : BugTracking-PT-q8m032-LTLCardinality-05 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:(LEQ s189 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 175 reset in 553 ms.
Product exploration explored 100000 steps with 178 reset in 572 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 17 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145812 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145812 steps, saw 74145 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:42:54] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:42:54] [INFO ] Invariant cache hit.
[2023-03-12 15:42:54] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:42:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:42:55] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:55] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:42:55] [INFO ] After 218ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:42:55] [INFO ] Deduced a trap composed of 63 places in 451 ms of which 0 ms to minimize.
[2023-03-12 15:42:56] [INFO ] Deduced a trap composed of 48 places in 449 ms of which 1 ms to minimize.
[2023-03-12 15:42:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1199 ms
[2023-03-12 15:42:56] [INFO ] After 1502ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-12 15:42:56] [INFO ] After 2413ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 3871
Applied a total of 12 rules in 122 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142941 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142941 steps, saw 58221 distinct states, run finished after 3003 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:42:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:43:00] [INFO ] Computed 8 place invariants in 29 ms
[2023-03-12 15:43:00] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:43:00] [INFO ] After 621ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:01] [INFO ] After 319ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:01] [INFO ] Deduced a trap composed of 19 places in 508 ms of which 1 ms to minimize.
[2023-03-12 15:43:03] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 0 ms to minimize.
[2023-03-12 15:43:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2501 ms
[2023-03-12 15:43:03] [INFO ] After 2906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-12 15:43:03] [INFO ] After 3712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 84 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:43:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:43:04] [INFO ] Invariant cache hit.
[2023-03-12 15:43:04] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-12 15:43:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:43:04] [INFO ] Invariant cache hit.
[2023-03-12 15:43:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:06] [INFO ] Implicit Places using invariants and state equation in 1963 ms returned []
Implicit Place search using SMT with State Equation took 2442 ms to find 0 implicit places.
[2023-03-12 15:43:06] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-12 15:43:06] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:43:06] [INFO ] Invariant cache hit.
[2023-03-12 15:43:07] [INFO ] Dead Transitions using invariants and state equation in 1127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3782 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 234 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:43:08] [INFO ] Computed 9 place invariants in 24 ms
[2023-03-12 15:43:08] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 15:43:08] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:08] [INFO ] After 634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 15:43:08] [INFO ] After 808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 9 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 15:43:09] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:43:09] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 15:43:09] [INFO ] Implicit Places using invariants in 338 ms returned []
[2023-03-12 15:43:09] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:43:09] [INFO ] Invariant cache hit.
[2023-03-12 15:43:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:11] [INFO ] Implicit Places using invariants and state equation in 1679 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-03-12 15:43:11] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:43:11] [INFO ] Invariant cache hit.
[2023-03-12 15:43:12] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3205 ms. Remains : 275/275 places, 3877/3877 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 163914 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163914 steps, saw 83419 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:43:15] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:43:15] [INFO ] Invariant cache hit.
[2023-03-12 15:43:15] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:43:16] [INFO ] After 568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:16] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:16] [INFO ] After 172ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:17] [INFO ] Deduced a trap composed of 63 places in 432 ms of which 1 ms to minimize.
[2023-03-12 15:43:17] [INFO ] Deduced a trap composed of 48 places in 395 ms of which 1 ms to minimize.
[2023-03-12 15:43:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1045 ms
[2023-03-12 15:43:17] [INFO ] After 1285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-12 15:43:17] [INFO ] After 2071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 3871
Applied a total of 12 rules in 132 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 141087 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141087 steps, saw 56980 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:43:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:43:21] [INFO ] Computed 8 place invariants in 22 ms
[2023-03-12 15:43:21] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 15:43:21] [INFO ] After 663ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:22] [INFO ] After 348ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:22] [INFO ] Deduced a trap composed of 19 places in 473 ms of which 1 ms to minimize.
[2023-03-12 15:43:24] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-12 15:43:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2453 ms
[2023-03-12 15:43:24] [INFO ] After 2880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-12 15:43:24] [INFO ] After 3719ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 54 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 53 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:43:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:43:24] [INFO ] Invariant cache hit.
[2023-03-12 15:43:25] [INFO ] Implicit Places using invariants in 430 ms returned []
[2023-03-12 15:43:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:43:25] [INFO ] Invariant cache hit.
[2023-03-12 15:43:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:27] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2260 ms to find 0 implicit places.
[2023-03-12 15:43:27] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-12 15:43:27] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:43:27] [INFO ] Invariant cache hit.
[2023-03-12 15:43:28] [INFO ] Dead Transitions using invariants and state equation in 1159 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3644 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 274 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:43:28] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-12 15:43:28] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:43:28] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:43:29] [INFO ] After 564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:43:29] [INFO ] After 645ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-12 15:43:29] [INFO ] After 786ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 173 reset in 546 ms.
Product exploration explored 100000 steps with 165 reset in 565 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 51 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 15:43:31] [INFO ] Redundant transitions in 151 ms returned []
[2023-03-12 15:43:31] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 15:43:31] [INFO ] Computed 8 place invariants in 23 ms
[2023-03-12 15:43:32] [INFO ] Dead Transitions using invariants and state equation in 1279 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1504 ms. Remains : 275/275 places, 3877/3877 transitions.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 9 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 15:43:32] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:43:32] [INFO ] Invariant cache hit.
[2023-03-12 15:43:33] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 15:43:33] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:43:33] [INFO ] Invariant cache hit.
[2023-03-12 15:43:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:43:35] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2263 ms to find 0 implicit places.
[2023-03-12 15:43:35] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 15:43:35] [INFO ] Invariant cache hit.
[2023-03-12 15:43:36] [INFO ] Dead Transitions using invariants and state equation in 1227 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3500 ms. Remains : 275/275 places, 3877/3877 transitions.
Treatment of property BugTracking-PT-q8m032-LTLCardinality-05 finished in 50365 ms.
[2023-03-12 15:43:36] [INFO ] Flatten gal took : 270 ms
[2023-03-12 15:43:36] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 15:43:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 278 places, 3904 transitions and 19190 arcs took 25 ms.
Total runtime 150015 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1175/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q8m032-LTLCardinality-05

BK_STOP 1678635817987

--------------------
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 BugTracking-PT-q8m032-LTLCardinality-05
ltl formula formula --ltl=/tmp/1175/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 278 places, 3904 transitions and 19190 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.490 real 0.090 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1175/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1175/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1175/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1175/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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)

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="BugTracking-PT-q8m032"
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 BugTracking-PT-q8m032, 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 r041-tajo-167813694700419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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