Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r476-tall-171620505300164.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CANInsertWithFailure-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300164
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 19 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 49M May 18 16:42 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-090-LTLFireability-00
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-01
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-02
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-03
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-04
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-05
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-06
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-07
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-08
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-09
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-10
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-11
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-12
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-13
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-14
FORMULA_NAME CANInsertWithFailure-PT-090-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717197461408

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-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:17:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:17:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:17:43] [INFO ] Load time of PNML (sax parser for PT used): 1045 ms
[2024-05-31 23:17:43] [INFO ] Transformed 17284 places.
[2024-05-31 23:17:43] [INFO ] Transformed 49140 transitions.
[2024-05-31 23:17:43] [INFO ] Parsed PT model containing 17284 places and 49140 transitions and 131400 arcs in 1280 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 122 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 17284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17284/17284 places, 49140/49140 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17283 transition count 49140
Applied a total of 1 rules in 8654 ms. Remains 17283 /17284 variables (removed 1) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-31 23:18:11] [INFO ] Computed 92 invariants in 18292 ms
[2024-05-31 23:18:42] [INFO ] Implicit Places using invariants in 48706 ms returned []
Implicit Place search using SMT only with invariants took 48740 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-05-31 23:18:42] [INFO ] Invariant cache hit.
[2024-05-31 23:18:43] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 281383ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 281864ms
Starting structural reductions in LTL mode, iteration 1 : 17283/17284 places, 49140/49140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 339456 ms. Remains : 17283/17284 places, 49140/49140 transitions.
Support contains 47 out of 17283 places after structural reductions.
[2024-05-31 23:23:25] [INFO ] Flatten gal took : 1268 ms
[2024-05-31 23:23:26] [INFO ] Flatten gal took : 970 ms
[2024-05-31 23:23:28] [INFO ] Input system was already deterministic with 49140 transitions.
Support contains 46 out of 17283 places (down from 47) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 34 to 33
RANDOM walk for 40000 steps (16 resets) in 3738 ms. (10 steps per ms) remains 20/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
[2024-05-31 23:23:30] [INFO ] Invariant cache hit.
[2024-05-31 23:23:30] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 17087/17113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:23:33] [INFO ] Deduced a trap composed of 5 places in 825 ms of which 33 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17113/66423 variables, and 8 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5265 ms.
Refiners :[Positive P Invariants (semi-flows): 7/90 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/17283 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 17087/17113 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17113 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-31 23:23:38] [INFO ] Deduced a trap composed of 5 places in 741 ms of which 5 ms to minimize.
[2024-05-31 23:23:39] [INFO ] Deduced a trap composed of 5 places in 764 ms of which 3 ms to minimize.
[2024-05-31 23:23:40] [INFO ] Deduced a trap composed of 5 places in 716 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17113/66423 variables, and 11 constraints, problems are : Problem set: 0 solved, 19 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/90 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/17283 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 0/19 constraints, Known Traps: 4/4 constraints]
After SMT, in 10727ms problems are : Problem set: 0 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 17283 transition count 48516
Reduce places removed 624 places and 0 transitions.
Iterating post reduction 1 with 624 rules applied. Total rules applied 1248 place count 16659 transition count 48516
Performed 7996 Post agglomeration using F-continuation condition.Transition count delta: 7996
Deduced a syphon composed of 7996 places in 18 ms
Reduce places removed 7996 places and 0 transitions.
Iterating global reduction 2 with 15992 rules applied. Total rules applied 17240 place count 8663 transition count 40520
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 2 with 7 rules applied. Total rules applied 17247 place count 8663 transition count 40513
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 17254 place count 8656 transition count 40513
Partial Free-agglomeration rule applied 8185 times.
Drop transitions (Partial Free agglomeration) removed 8185 transitions
Iterating global reduction 3 with 8185 rules applied. Total rules applied 25439 place count 8656 transition count 40513
Applied a total of 25439 rules in 22295 ms. Remains 8656 /17283 variables (removed 8627) and now considering 40513/49140 (removed 8627) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22299 ms. Remains : 8656/17283 places, 40513/49140 transitions.
RANDOM walk for 40000 steps (72 resets) in 3251 ms. (12 steps per ms) remains 6/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/5 properties
[2024-05-31 23:24:04] [INFO ] Flow matrix only has 40507 transitions (discarded 6 similar events)
// Phase 1: matrix 40507 rows 8656 cols
[2024-05-31 23:24:08] [INFO ] Computed 92 invariants in 3784 ms
[2024-05-31 23:24:08] [INFO ] State equation strengthened by 40190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8470/8474 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:24:10] [INFO ] Deduced a trap composed of 2 places in 280 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8474 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8474 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 178/8652 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8652 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/8654 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 23:24:38] [INFO ] Deduced a trap composed of 96 places in 24271 ms of which 62 ms to minimize.
[2024-05-31 23:25:01] [INFO ] Deduced a trap composed of 100 places in 22614 ms of which 60 ms to minimize.
SMT process timed out in 56947ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 8656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8656/8656 places, 40513/40513 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 13 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 8646 transition count 40503
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 8646 transition count 40503
Applied a total of 26 rules in 10145 ms. Remains 8646 /8656 variables (removed 10) and now considering 40503/40513 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10146 ms. Remains : 8646/8656 places, 40503/40513 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5761 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-05-31 23:25:33] [INFO ] Computed 92 invariants in 15524 ms
[2024-05-31 23:26:06] [INFO ] Performed 1230/17283 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:26:06] [INFO ] Implicit Places using invariants in 49114 ms returned []
Implicit Place search using SMT only with invariants took 49115 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-05-31 23:26:07] [INFO ] Invariant cache hit.
[2024-05-31 23:26:07] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 268986ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 269422ms
Finished structural reductions in LTL mode , in 1 iterations and 324381 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-00 finished in 324865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(p0))))))'
Support contains 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6577 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-31 23:30:43] [INFO ] Invariant cache hit.
[2024-05-31 23:31:16] [INFO ] Performed 1197/17283 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:31:18] [INFO ] Implicit Places using invariants in 34521 ms returned []
Implicit Place search using SMT only with invariants took 34523 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-05-31 23:31:18] [INFO ] Invariant cache hit.
[2024-05-31 23:31:18] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 314607ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 315084ms
Finished structural reductions in LTL mode , in 1 iterations and 356272 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-02
Stuttering criterion allowed to conclude after 2449 steps with 0 reset in 249 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-02 finished in 356760 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&G(p1)))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5597 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-31 23:36:39] [INFO ] Invariant cache hit.
[2024-05-31 23:37:12] [INFO ] Performed 1197/17283 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:37:13] [INFO ] Implicit Places using invariants in 34460 ms returned []
Implicit Place search using SMT only with invariants took 34461 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-05-31 23:37:14] [INFO ] Invariant cache hit.
[2024-05-31 23:37:14] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 303588ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 304202ms
Finished structural reductions in LTL mode , in 1 iterations and 344341 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-03 finished in 344662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&G(p1)) U X((X(X(!p1)) U (F(p3)&&p2)))))'
Support contains 6 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 8456 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-31 23:42:26] [INFO ] Invariant cache hit.
[2024-05-31 23:42:59] [INFO ] Performed 1253/17283 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:42:59] [INFO ] Implicit Places using invariants in 33055 ms returned []
Implicit Place search using SMT only with invariants took 33059 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-05-31 23:43:00] [INFO ] Invariant cache hit.
[2024-05-31 23:43:00] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 304888ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 305454ms
Finished structural reductions in LTL mode , in 1 iterations and 347041 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 504 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true, false, (AND (NOT p3) (NOT p1)), false, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-04
Product exploration explored 100000 steps with 19982 reset in 4791 ms.
Product exploration explored 100000 steps with 19983 reset in 4224 ms.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 110 ms. Reduced automaton from 12 states, 27 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
RANDOM walk for 40000 steps (16 resets) in 1519 ms. (26 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
[2024-05-31 23:48:16] [INFO ] Invariant cache hit.
[2024-05-31 23:48:16] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 17100/17103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 23:48:19] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 3 ms to minimize.
[2024-05-31 23:48:20] [INFO ] Deduced a trap composed of 5 places in 632 ms of which 3 ms to minimize.
[2024-05-31 23:48:21] [INFO ] Deduced a trap composed of 5 places in 637 ms of which 3 ms to minimize.
[2024-05-31 23:48:22] [INFO ] Deduced a trap composed of 5 places in 670 ms of which 3 ms to minimize.
SMT process timed out in 5809ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 17283 transition count 48511
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 16654 transition count 48511
Performed 8010 Post agglomeration using F-continuation condition.Transition count delta: 8010
Deduced a syphon composed of 8010 places in 24 ms
Reduce places removed 8010 places and 0 transitions.
Iterating global reduction 2 with 16020 rules applied. Total rules applied 17278 place count 8644 transition count 40501
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17280 place count 8644 transition count 40499
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 17282 place count 8642 transition count 40499
Partial Free-agglomeration rule applied 8189 times.
Drop transitions (Partial Free agglomeration) removed 8189 transitions
Iterating global reduction 3 with 8189 rules applied. Total rules applied 25471 place count 8642 transition count 40499
Applied a total of 25471 rules in 21715 ms. Remains 8642 /17283 variables (removed 8641) and now considering 40499/49140 (removed 8641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21718 ms. Remains : 8642/17283 places, 40499/49140 transitions.
RANDOM walk for 40000 steps (72 resets) in 2348 ms. (17 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p3))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p2) p3))), (F p2), (F p3)]
Knowledge based reduction with 25 factoid took 268 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
[2024-05-31 23:48:45] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2024-05-31 23:49:00] [INFO ] Invariant cache hit.
Could not prove EG (NOT p3)
Support contains 5 out of 17283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6068 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-05-31 23:49:21] [INFO ] Invariant cache hit.
[2024-05-31 23:49:54] [INFO ] Performed 1216/17283 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:49:55] [INFO ] Implicit Places using invariants in 33926 ms returned []
Implicit Place search using SMT only with invariants took 33928 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-05-31 23:49:56] [INFO ] Invariant cache hit.
[2024-05-31 23:49:56] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 312593ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 313061ms
Finished structural reductions in LTL mode , in 1 iterations and 353148 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Computed a total of 362 stabilizing places and 630 stable transitions
Computed a total of 362 stabilizing places and 630 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT p2)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 101 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
RANDOM walk for 40000 steps (16 resets) in 2022 ms. (19 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 1/1 properties
[2024-05-31 23:55:10] [INFO ] Invariant cache hit.
[2024-05-31 23:55:10] [INFO ] State equation strengthened by 16110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17100/17101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:55:13] [INFO ] Deduced a trap composed of 5 places in 636 ms of which 3 ms to minimize.
[2024-05-31 23:55:14] [INFO ] Deduced a trap composed of 5 places in 644 ms of which 3 ms to minimize.
[2024-05-31 23:55:14] [INFO ] Deduced a trap composed of 5 places in 633 ms of which 5 ms to minimize.
[2024-05-31 23:55:15] [INFO ] Deduced a trap composed of 5 places in 634 ms of which 3 ms to minimize.
SMT process timed out in 5578ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 17283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 17283 transition count 48510
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 16653 transition count 48510
Performed 8010 Post agglomeration using F-continuation condition.Transition count delta: 8010
Deduced a syphon composed of 8010 places in 19 ms
Reduce places removed 8010 places and 0 transitions.
Iterating global reduction 2 with 16020 rules applied. Total rules applied 17280 place count 8643 transition count 40500
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17281 place count 8643 transition count 40499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17282 place count 8642 transition count 40499
Partial Free-agglomeration rule applied 8190 times.
Drop transitions (Partial Free agglomeration) removed 8190 transitions
Iterating global reduction 3 with 8190 rules applied. Total rules applied 25472 place count 8642 transition count 40499
Applied a total of 25472 rules in 21214 ms. Remains 8642 /17283 variables (removed 8641) and now considering 40499/49140 (removed 8641) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21217 ms. Remains : 8642/17283 places, 40499/49140 transitions.
RANDOM walk for 34606 steps (62 resets) in 1548 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), (X (NOT (AND p2 (NOT p3)))), (X (NOT p3)), (X (NOT p2)), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p1), (F p3), (F p2), (F (NOT (OR p3 (NOT p2))))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
[2024-05-31 23:55:38] [INFO ] Invariant cache hit.
Could not prove EG (NOT p2)
[2024-05-31 23:55:53] [INFO ] Invariant cache hit.
Could not prove EG (NOT p3)
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Product exploration explored 100000 steps with 20050 reset in 3741 ms.
Product exploration explored 100000 steps with 19986 reset in 3659 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, true]
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 17283 transition count 49140
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 447 place count 17283 transition count 49140
Deduced a syphon composed of 540 places in 14 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 540 place count 17283 transition count 49140
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 17103 transition count 48960
Deduced a syphon composed of 360 places in 15 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 17103 transition count 48960
Performed 8097 Post agglomeration using F-continuation condition.Transition count delta: -15840
Deduced a syphon composed of 8457 places in 17 ms
Iterating global reduction 1 with 8097 rules applied. Total rules applied 8997 place count 17103 transition count 64800
Discarding 354 places :
Symmetric choice reduction at 1 with 354 rule applications. Total rules 9351 place count 16749 transition count 64446
Deduced a syphon composed of 8103 places in 11 ms
Iterating global reduction 1 with 354 rules applied. Total rules applied 9705 place count 16749 transition count 64446
Deduced a syphon composed of 8103 places in 10 ms
Applied a total of 9705 rules in 34500 ms. Remains 16749 /17283 variables (removed 534) and now considering 64446/49140 (removed -15306) transitions.
Running 64356 sub problems to find dead transitions.
[2024-05-31 23:56:51] [INFO ] Flow matrix only has 56614 transitions (discarded 7832 similar events)
// Phase 1: matrix 56614 rows 16749 cols
[2024-05-31 23:57:07] [INFO ] Computed 92 invariants in 16164 ms
[2024-05-31 23:57:08] [INFO ] State equation strengthened by 24207 read => feed constraints.
SMT process timed out in 547795ms, After SMT, problems are : Problem set: 0 solved, 64356 unsolved
Search for dead transitions found 0 dead transitions in 548309ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16749/17283 places, 64446/49140 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 582889 ms. Remains : 16749/17283 places, 64446/49140 transitions.
Support contains 5 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5662 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
// Phase 1: matrix 49140 rows 17283 cols
[2024-06-01 00:06:19] [INFO ] Computed 92 invariants in 14757 ms
[2024-06-01 00:06:51] [INFO ] Implicit Places using invariants in 46689 ms returned []
Implicit Place search using SMT only with invariants took 46690 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-06-01 00:06:52] [INFO ] Invariant cache hit.
[2024-06-01 00:06:52] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 254662ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 255135ms
Finished structural reductions in LTL mode , in 1 iterations and 307545 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-04 finished in 1730284 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0||G(p1))))&&F(p2)))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 5815 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-06-01 00:11:14] [INFO ] Invariant cache hit.
[2024-06-01 00:11:46] [INFO ] Implicit Places using invariants in 31977 ms returned []
Implicit Place search using SMT only with invariants took 31982 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-06-01 00:11:46] [INFO ] Invariant cache hit.
[2024-06-01 00:11:47] [INFO ] State equation strengthened by 16110 read => feed constraints.
SMT process timed out in 261352ms, After SMT, problems are : Problem set: 0 solved, 49050 unsolved
Search for dead transitions found 0 dead transitions in 261752ms
Finished structural reductions in LTL mode , in 1 iterations and 299602 ms. Remains : 17283/17283 places, 49140/49140 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-090-LTLFireability-05
Stuttering criterion allowed to conclude after 2256 steps with 0 reset in 56 ms.
FORMULA CANInsertWithFailure-PT-090-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-090-LTLFireability-05 finished in 299938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(p2))))'
Support contains 4 out of 17283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17283/17283 places, 49140/49140 transitions.
Applied a total of 0 rules in 6501 ms. Remains 17283 /17283 variables (removed 0) and now considering 49140/49140 (removed 0) transitions.
[2024-06-01 00:16:15] [INFO ] Invariant cache hit.
[2024-06-01 00:16:47] [INFO ] Performed 1225/17283 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-01 00:16:48] [INFO ] Implicit Places using invariants in 33329 ms returned []
Implicit Place search using SMT only with invariants took 33330 ms to find 0 implicit places.
Running 49050 sub problems to find dead transitions.
[2024-06-01 00:16:48] [INFO ] Invariant cache hit.
[2024-06-01 00:16:49] [INFO ] State equation strengthened by 16110 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-090"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-090, 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 r476-tall-171620505300164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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