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-167813695100740.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 CANInsertWithFailure-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813695100740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 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 CANInsertWithFailure-PT-050-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678662454900

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 23:07:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 23:07:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 23:07:37] [INFO ] Load time of PNML (sax parser for PT used): 434 ms
[2023-03-12 23:07:37] [INFO ] Transformed 5604 places.
[2023-03-12 23:07:37] [INFO ] Transformed 15300 transitions.
[2023-03-12 23:07:37] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 587 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 906 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:07:39] [INFO ] Computed 52 place invariants in 1345 ms
[2023-03-12 23:07:41] [INFO ] Implicit Places using invariants in 2699 ms returned []
Implicit Place search using SMT only with invariants took 2748 ms to find 0 implicit places.
[2023-03-12 23:07:41] [INFO ] Invariant cache hit.
[2023-03-12 23:07:49] [INFO ] Dead Transitions using invariants and state equation in 8360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12030 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 46 out of 5603 places after structural reductions.
[2023-03-12 23:07:50] [INFO ] Flatten gal took : 882 ms
[2023-03-12 23:07:51] [INFO ] Flatten gal took : 351 ms
[2023-03-12 23:07:52] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 43 out of 5603 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 724 ms. (steps per millisecond=13 ) properties (out of 32) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-12 23:07:53] [INFO ] Invariant cache hit.
[2023-03-12 23:07:55] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2023-03-12 23:07:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 74 ms returned sat
[2023-03-12 23:08:13] [INFO ] After 16720ms SMT Verify possible using state equation in real domain returned unsat :0 sat :19
[2023-03-12 23:08:14] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2023-03-12 23:08:18] [INFO ] After 4423ms SMT Verify possible using 4950 Read/Feed constraints in real domain returned unsat :0 sat :14 real:5
[2023-03-12 23:08:18] [INFO ] After 4427ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :14 real:5
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-12 23:08:18] [INFO ] After 25075ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :14 real:5
[2023-03-12 23:08:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 61 ms returned sat
[2023-03-12 23:08:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 87 ms returned sat
[2023-03-12 23:08:41] [INFO ] After 18208ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-12 23:08:43] [INFO ] After 2269ms SMT Verify possible using 4950 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-12 23:08:43] [INFO ] After 2271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-12 23:08:43] [INFO ] After 25068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 5 properties in 766 ms.
Support contains 19 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2439 Post agglomeration using F-continuation condition.Transition count delta: 2439
Deduced a syphon composed of 2439 places in 18 ms
Reduce places removed 2439 places and 0 transitions.
Iterating global reduction 2 with 4878 rules applied. Total rules applied 5574 place count 2816 transition count 12513
Drop transitions removed 2341 transitions
Redundant transition composition rules discarded 2341 transitions
Iterating global reduction 2 with 2341 rules applied. Total rules applied 7915 place count 2816 transition count 10172
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7918 place count 2816 transition count 10169
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 7921 place count 2813 transition count 10169
Partial Free-agglomeration rule applied 2545 times.
Drop transitions removed 2545 transitions
Iterating global reduction 3 with 2545 rules applied. Total rules applied 10466 place count 2813 transition count 10169
Applied a total of 10466 rules in 3596 ms. Remains 2813 /5603 variables (removed 2790) and now considering 10169/15300 (removed 5131) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3598 ms. Remains : 2813/5603 places, 10169/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 521 ms. (steps per millisecond=19 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 10169 rows 2813 cols
[2023-03-12 23:08:49] [INFO ] Computed 52 place invariants in 377 ms
[2023-03-12 23:08:49] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-12 23:08:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-12 23:08:54] [INFO ] After 4104ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:2
[2023-03-12 23:08:54] [INFO ] State equation strengthened by 9981 read => feed constraints.
[2023-03-12 23:08:56] [INFO ] After 2755ms SMT Verify possible using 9981 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:08:56] [INFO ] After 7898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 23:08:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 33 ms returned sat
[2023-03-12 23:08:57] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2023-03-12 23:09:01] [INFO ] After 4023ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 23:09:05] [INFO ] After 3945ms SMT Verify possible using 9981 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 23:09:09] [INFO ] After 7249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1916 ms.
[2023-03-12 23:09:11] [INFO ] After 14133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 1 different solutions.
Finished Parikh walk after 76 steps, including 0 resets, run visited all 6 properties in 5 ms. (steps per millisecond=15 )
Parikh walk visited 6 properties in 5 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 629 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:09:13] [INFO ] Computed 52 place invariants in 1188 ms
[2023-03-12 23:09:14] [INFO ] Implicit Places using invariants in 2274 ms returned []
Implicit Place search using SMT only with invariants took 2275 ms to find 0 implicit places.
[2023-03-12 23:09:14] [INFO ] Invariant cache hit.
[2023-03-12 23:09:22] [INFO ] Dead Transitions using invariants and state equation in 8172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11081 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2078 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1493 steps with 0 reset in 39 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-00 finished in 11438 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' '!((p0 U (F(p1)&&(p2||X((X(G(p3)) U (p2&&X(G(p3)))))))))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 525 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-12 23:09:23] [INFO ] Invariant cache hit.
[2023-03-12 23:09:24] [INFO ] Implicit Places using invariants in 1106 ms returned []
Implicit Place search using SMT only with invariants took 1109 ms to find 0 implicit places.
[2023-03-12 23:09:24] [INFO ] Invariant cache hit.
[2023-03-12 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 8494 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10139 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s194 1) (GEQ s497 1)), p2:(GEQ s4940 1), p0:(GEQ s5158 1), p3:(GEQ s4592 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 484 steps with 1 reset in 9 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-01 finished in 10540 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' '!((p0 U (!X(F(p0)) U p1)))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 6 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Applied a total of 7947 rules in 2424 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10151/15300 (removed 5149) transitions.
// Phase 1: matrix 10151 rows 2805 cols
[2023-03-12 23:09:36] [INFO ] Computed 52 place invariants in 367 ms
[2023-03-12 23:09:38] [INFO ] Implicit Places using invariants in 2727 ms returned []
Implicit Place search using SMT only with invariants took 2730 ms to find 0 implicit places.
[2023-03-12 23:09:38] [INFO ] Invariant cache hit.
[2023-03-12 23:09:44] [INFO ] Dead Transitions using invariants and state equation in 5479 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10151/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10638 ms. Remains : 2805/5603 places, 10151/15300 transitions.
Stuttering acceptance computed with spot in 147 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s598 1), p1:(AND (GEQ s101 1) (GEQ s2271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 249 steps with 0 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-02 finished in 10831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((F(p1)||G(p2)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 536 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:09:46] [INFO ] Computed 52 place invariants in 1150 ms
[2023-03-12 23:09:47] [INFO ] Implicit Places using invariants in 2230 ms returned []
Implicit Place search using SMT only with invariants took 2231 ms to find 0 implicit places.
[2023-03-12 23:09:47] [INFO ] Invariant cache hit.
[2023-03-12 23:09:55] [INFO ] Dead Transitions using invariants and state equation in 8260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11029 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s483 1) (GEQ s684 1)), p0:(GEQ s4298 1), p2:(GEQ s3794 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2272 steps with 1 reset in 42 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-03 finished in 11364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Iterating post reduction 1 with 347 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 694 place count 5256 transition count 14952
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 6 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7946 place count 2806 transition count 10151
Applied a total of 7946 rules in 2284 ms. Remains 2806 /5603 variables (removed 2797) and now considering 10151/15300 (removed 5149) transitions.
// Phase 1: matrix 10151 rows 2806 cols
[2023-03-12 23:09:58] [INFO ] Computed 52 place invariants in 315 ms
[2023-03-12 23:10:00] [INFO ] Implicit Places using invariants in 2323 ms returned []
Implicit Place search using SMT only with invariants took 2324 ms to find 0 implicit places.
[2023-03-12 23:10:00] [INFO ] Invariant cache hit.
[2023-03-12 23:10:05] [INFO ] Dead Transitions using invariants and state equation in 4972 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5603 places, 10151/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9582 ms. Remains : 2806/5603 places, 10151/15300 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s17 1) (LT s2708 1)), p0:(AND (GEQ s108 1) (GEQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 391 reset in 1371 ms.
Product exploration explored 100000 steps with 392 reset in 1406 ms.
Computed a total of 152 stabilizing places and 251 stable transitions
Computed a total of 152 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2246 steps, including 8 resets, run visited all 2 properties in 54 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 220 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10151/10151 transitions.
Applied a total of 0 rules in 426 ms. Remains 2806 /2806 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
[2023-03-12 23:10:09] [INFO ] Invariant cache hit.
[2023-03-12 23:10:11] [INFO ] Implicit Places using invariants in 2516 ms returned []
Implicit Place search using SMT only with invariants took 2519 ms to find 0 implicit places.
[2023-03-12 23:10:11] [INFO ] Invariant cache hit.
[2023-03-12 23:10:17] [INFO ] Dead Transitions using invariants and state equation in 5322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8272 ms. Remains : 2806/2806 places, 10151/10151 transitions.
Computed a total of 152 stabilizing places and 251 stable transitions
Computed a total of 152 stabilizing places and 251 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 127 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 2143 steps, including 8 resets, run visited all 2 properties in 50 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 389 reset in 1474 ms.
Product exploration explored 100000 steps with 394 reset in 1391 ms.
Support contains 4 out of 2806 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2806/2806 places, 10151/10151 transitions.
Applied a total of 0 rules in 349 ms. Remains 2806 /2806 variables (removed 0) and now considering 10151/10151 (removed 0) transitions.
[2023-03-12 23:10:21] [INFO ] Invariant cache hit.
[2023-03-12 23:10:23] [INFO ] Implicit Places using invariants in 2046 ms returned []
Implicit Place search using SMT only with invariants took 2047 ms to find 0 implicit places.
[2023-03-12 23:10:23] [INFO ] Invariant cache hit.
[2023-03-12 23:10:28] [INFO ] Dead Transitions using invariants and state equation in 5024 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7422 ms. Remains : 2806/2806 places, 10151/10151 transitions.
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-04 finished in 33171 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)||(p0&&F((p1||G(p2)))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 524 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:10:30] [INFO ] Computed 52 place invariants in 1134 ms
[2023-03-12 23:10:31] [INFO ] Implicit Places using invariants in 2318 ms returned []
Implicit Place search using SMT only with invariants took 2319 ms to find 0 implicit places.
[2023-03-12 23:10:31] [INFO ] Invariant cache hit.
[2023-03-12 23:10:40] [INFO ] Dead Transitions using invariants and state equation in 8841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11690 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s5362 1), p1:(LT s3364 1), p2:(LT s1798 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4004 ms.
Product exploration explored 100000 steps with 50000 reset in 3748 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 140 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-050-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-05 finished in 19867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X((p1||X(X(G(p2))))))))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 583 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-12 23:10:49] [INFO ] Invariant cache hit.
[2023-03-12 23:10:50] [INFO ] Implicit Places using invariants in 1066 ms returned []
Implicit Place search using SMT only with invariants took 1068 ms to find 0 implicit places.
[2023-03-12 23:10:50] [INFO ] Invariant cache hit.
[2023-03-12 23:10:51] [INFO ] Dead Transitions using invariants and state equation in 738 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2391 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 417 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={} source=7 dest: 2}]], initial=6, aps=[p0:(GEQ s1360 1), p1:(GEQ s2043 1), p2:(OR (LT s553 1) (LT s3915 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17199 steps with 13 reset in 300 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-06 finished in 3169 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 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 685 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-12 23:10:52] [INFO ] Invariant cache hit.
[2023-03-12 23:10:53] [INFO ] Implicit Places using invariants in 1180 ms returned []
Implicit Place search using SMT only with invariants took 1181 ms to find 0 implicit places.
[2023-03-12 23:10:53] [INFO ] Invariant cache hit.
[2023-03-12 23:11:01] [INFO ] Dead Transitions using invariants and state equation in 8096 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9963 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3489 1) (GEQ s525 1) (GEQ s4303 1) (GEQ s2714 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-07 finished in 10127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 8 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7950 place count 2804 transition count 10149
Applied a total of 7950 rules in 2190 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10149/15300 (removed 5151) transitions.
// Phase 1: matrix 10149 rows 2804 cols
[2023-03-12 23:11:04] [INFO ] Computed 52 place invariants in 406 ms
[2023-03-12 23:11:06] [INFO ] Implicit Places using invariants in 2617 ms returned []
Implicit Place search using SMT only with invariants took 2621 ms to find 0 implicit places.
[2023-03-12 23:11:06] [INFO ] Invariant cache hit.
[2023-03-12 23:11:12] [INFO ] Dead Transitions using invariants and state equation in 5190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10149/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10004 ms. Remains : 2804/5603 places, 10149/15300 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s95 1) (GEQ s1119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 273 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-09 finished in 10097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 696 place count 5255 transition count 14951
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 5 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7948 place count 2805 transition count 10150
Applied a total of 7948 rules in 2376 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2805 cols
[2023-03-12 23:11:14] [INFO ] Computed 52 place invariants in 398 ms
[2023-03-12 23:11:17] [INFO ] Implicit Places using invariants in 2652 ms returned []
Implicit Place search using SMT only with invariants took 2655 ms to find 0 implicit places.
[2023-03-12 23:11:17] [INFO ] Invariant cache hit.
[2023-03-12 23:11:22] [INFO ] Dead Transitions using invariants and state equation in 5005 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10040 ms. Remains : 2805/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s216 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 279 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-10 finished in 10118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 548 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-12 23:11:23] [INFO ] Computed 52 place invariants in 1131 ms
[2023-03-12 23:11:25] [INFO ] Implicit Places using invariants in 2331 ms returned []
Implicit Place search using SMT only with invariants took 2332 ms to find 0 implicit places.
[2023-03-12 23:11:25] [INFO ] Invariant cache hit.
[2023-03-12 23:11:33] [INFO ] Dead Transitions using invariants and state equation in 8359 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11240 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s599 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11943 steps with 59 reset in 153 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-12 finished in 11504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((F(p1)&&F(G(p2)))))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 508 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-12 23:11:34] [INFO ] Invariant cache hit.
[2023-03-12 23:11:35] [INFO ] Implicit Places using invariants in 1115 ms returned []
Implicit Place search using SMT only with invariants took 1116 ms to find 0 implicit places.
[2023-03-12 23:11:35] [INFO ] Invariant cache hit.
[2023-03-12 23:11:43] [INFO ] Dead Transitions using invariants and state equation in 8505 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10134 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1696 1), p1:(LT s3682 1), p2:(GEQ s4739 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 2838 ms.
Product exploration explored 100000 steps with 33333 reset in 2581 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-050-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-13 finished in 16039 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 534 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-12 23:11:50] [INFO ] Invariant cache hit.
[2023-03-12 23:11:51] [INFO ] Implicit Places using invariants in 1132 ms returned []
Implicit Place search using SMT only with invariants took 1135 ms to find 0 implicit places.
[2023-03-12 23:11:51] [INFO ] Invariant cache hit.
[2023-03-12 23:11:59] [INFO ] Dead Transitions using invariants and state equation in 7696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9368 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GEQ s5026 1), p0:(OR (LT s3245 1) (LT s2136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 3485 ms.
Product exploration explored 100000 steps with 50000 reset in 3442 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-14 finished in 16681 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&&(p0 U (p1||G(p0)))))))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 5 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 2086 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-12 23:12:08] [INFO ] Computed 52 place invariants in 419 ms
[2023-03-12 23:12:10] [INFO ] Implicit Places using invariants in 2356 ms returned []
Implicit Place search using SMT only with invariants took 2357 ms to find 0 implicit places.
[2023-03-12 23:12:10] [INFO ] Invariant cache hit.
[2023-03-12 23:12:16] [INFO ] Dead Transitions using invariants and state equation in 5105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9548 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1099 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 393 reset in 1298 ms.
Stack based approach found an accepted trace after 53656 steps with 211 reset with depth 100 and stack size 100 in 707 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-15 finished in 11629 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-12 23:12:18] [INFO ] Flatten gal took : 310 ms
[2023-03-12 23:12:18] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 23:12:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5603 places, 15300 transitions and 40900 arcs took 67 ms.
Total runtime 282063 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1032/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : CANInsertWithFailure-PT-050-LTLFireability-04

BK_STOP 1678662747613

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name CANInsertWithFailure-PT-050-LTLFireability-04
ltl formula formula --ltl=/tmp/1032/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 5603 places, 15300 transitions and 40900 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 1.990 real 0.540 user 0.630 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1032/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x561562eec3f4]
1: pnml2lts-mc(+0xa2496) [0x561562eec496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f27d9309140]
3: pnml2lts-mc(+0x405be5) [0x56156324fbe5]
4: pnml2lts-mc(+0x16b3f9) [0x561562fb53f9]
5: pnml2lts-mc(+0x164ac4) [0x561562faeac4]
6: pnml2lts-mc(+0x272e0a) [0x5615630bce0a]
7: pnml2lts-mc(+0xb61f0) [0x561562f001f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f27d915c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f27d915c67a]
10: pnml2lts-mc(+0xa1581) [0x561562eeb581]
11: pnml2lts-mc(+0xa1910) [0x561562eeb910]
12: pnml2lts-mc(+0xa32a2) [0x561562eed2a2]
13: pnml2lts-mc(+0xa50f4) [0x561562eef0f4]
14: pnml2lts-mc(+0xa516b) [0x561562eef16b]
15: pnml2lts-mc(+0x3f34b3) [0x56156323d4b3]
16: pnml2lts-mc(+0x7c63d) [0x561562ec663d]
17: pnml2lts-mc(+0x67d86) [0x561562eb1d86]
18: pnml2lts-mc(+0x60a8a) [0x561562eaaa8a]
19: pnml2lts-mc(+0x5eb15) [0x561562ea8b15]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f27d9144d0a]
21: pnml2lts-mc(+0x6075e) [0x561562eaa75e]

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;