fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r476-tall-171620505300171
Last Updated
July 7, 2024

About the Execution of LTSMin+red for CANInsertWithFailure-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16201.695 3600000.00 6438417.00 7566.70 F?F???T??T????TT normal

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-171620505300171.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-100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620505300171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K 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 4.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K 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.1K 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 60M 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-100-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717199446390

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:50:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:50:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:50:48] [INFO ] Load time of PNML (sax parser for PT used): 1269 ms
[2024-05-31 23:50:49] [INFO ] Transformed 21204 places.
[2024-05-31 23:50:49] [INFO ] Transformed 60600 transitions.
[2024-05-31 23:50:49] [INFO ] Parsed PT model containing 21204 places and 60600 transitions and 162000 arcs in 1582 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 21204 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21204/21204 places, 60600/60600 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 21203 transition count 60600
Applied a total of 1 rules in 7856 ms. Remains 21203 /21204 variables (removed 1) and now considering 60600/60600 (removed 0) transitions.
// Phase 1: matrix 60600 rows 21203 cols
[2024-05-31 23:51:24] [INFO ] Computed 102 invariants in 26348 ms
[2024-05-31 23:51:58] [INFO ] Performed 861/21203 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 23:52:16] [INFO ] Implicit Places using invariants in 78768 ms returned []
Implicit Place search using SMT only with invariants took 78802 ms to find 0 implicit places.
Running 60500 sub problems to find dead transitions.
[2024-05-31 23:52:17] [INFO ] Invariant cache hit.
[2024-05-31 23:52:17] [INFO ] State equation strengthened by 19900 read => feed constraints.
SMT process timed out in 471659ms, After SMT, problems are : Problem set: 0 solved, 60500 unsolved
Search for dead transitions found 0 dead transitions in 472308ms
Starting structural reductions in LTL mode, iteration 1 : 21203/21204 places, 60600/60600 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559156 ms. Remains : 21203/21204 places, 60600/60600 transitions.
Support contains 34 out of 21203 places after structural reductions.
[2024-06-01 00:00:11] [INFO ] Flatten gal took : 2006 ms
[2024-06-01 00:00:13] [INFO ] Flatten gal took : 1258 ms
[2024-06-01 00:00:16] [INFO ] Input system was already deterministic with 60600 transitions.
RANDOM walk for 40000 steps (13 resets) in 5678 ms. (7 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
Interrupted probabilistic random walk after 68570 steps, run timeout after 3002 ms. (steps per millisecond=22 ) properties seen :0 out of 25
Probabilistic random walk after 68570 steps, saw 67690 distinct states, run finished after 3010 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 00:00:21] [INFO ] Invariant cache hit.
[2024-06-01 00:00:22] [INFO ] State equation strengthened by 19900 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 20968/21001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21001/81803 variables, and 1 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/21203 constraints, ReadFeed: 0/19900 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 20968/21001 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 00:00:31] [INFO ] Deduced a trap composed of 5 places in 1216 ms of which 38 ms to minimize.
[2024-06-01 00:00:32] [INFO ] Deduced a trap composed of 5 places in 1151 ms of which 4 ms to minimize.
SMT process timed out in 11417ms, After SMT, problems are : Problem set: 0 solved, 25 unsolved
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 33 out of 21203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9880 Post agglomeration using F-continuation condition.Transition count delta: 9880
Deduced a syphon composed of 9880 places in 41 ms
Reduce places removed 9880 places and 0 transitions.
Iterating global reduction 2 with 19760 rules applied. Total rules applied 21160 place count 10623 transition count 50020
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21161 place count 10623 transition count 50019
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21162 place count 10622 transition count 50019
Partial Free-agglomeration rule applied 10088 times.
Drop transitions (Partial Free agglomeration) removed 10088 transitions
Iterating global reduction 3 with 10088 rules applied. Total rules applied 31250 place count 10622 transition count 50019
Applied a total of 31250 rules in 33407 ms. Remains 10622 /21203 variables (removed 10581) and now considering 50019/60600 (removed 10581) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33410 ms. Remains : 10622/21203 places, 50019/60600 transitions.
RANDOM walk for 40000 steps (64 resets) in 3828 ms. (10 steps per ms) remains 19/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 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 15 ms. (250 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 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 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 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 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 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 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 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
[2024-06-01 00:01:07] [INFO ] Flow matrix only has 50006 transitions (discarded 13 similar events)
// Phase 1: matrix 50006 rows 10622 cols
[2024-06-01 00:01:17] [INFO ] Computed 102 invariants in 9579 ms
[2024-06-01 00:01:17] [INFO ] State equation strengthened by 49634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 10396/10420 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10420 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 198/10618 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10618 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/10620 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10620 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 50006/60626 variables, 10620/10722 constraints. Problems are: Problem set: 0 solved, 19 unsolved
SMT process timed out in 55495ms, After SMT, problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 24 out of 10622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10622/10622 places, 50019/50019 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 18 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 10618 transition count 50015
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 10618 transition count 50015
Applied a total of 13 rules in 15197 ms. Remains 10618 /10622 variables (removed 4) and now considering 50015/50019 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15197 ms. Remains : 10618/10622 places, 50015/50019 transitions.
Computed a total of 402 stabilizing places and 700 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' '!(G(F(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9900 Post agglomeration using F-continuation condition.Transition count delta: 9900
Deduced a syphon composed of 9900 places in 21 ms
Reduce places removed 9900 places and 0 transitions.
Iterating global reduction 2 with 19800 rules applied. Total rules applied 21200 place count 10603 transition count 50000
Applied a total of 21200 rules in 16204 ms. Remains 10603 /21203 variables (removed 10600) and now considering 50000/60600 (removed 10600) transitions.
[2024-06-01 00:02:34] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
// Phase 1: matrix 40298 rows 10603 cols
[2024-06-01 00:02:46] [INFO ] Computed 102 invariants in 11310 ms
[2024-06-01 00:03:11] [INFO ] Implicit Places using invariants in 37080 ms returned []
Implicit Place search using SMT only with invariants took 37098 ms to find 0 implicit places.
Running 49900 sub problems to find dead transitions.
[2024-06-01 00:03:12] [INFO ] Flow matrix only has 40298 transitions (discarded 9702 similar events)
[2024-06-01 00:03:12] [INFO ] Invariant cache hit.
[2024-06-01 00:03:13] [INFO ] State equation strengthened by 29898 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10602/50901 variables, and 100 constraints, problems are : Problem set: 0 solved, 49900 unsolved in 30556 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 49900/49900 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49900 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10602/50901 variables, and 100 constraints, problems are : Problem set: 0 solved, 49900 unsolved in 30497 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10603 constraints, ReadFeed: 0/29898 constraints, PredecessorRefiner: 0/49900 constraints, Known Traps: 0/0 constraints]
After SMT, in 323372ms problems are : Problem set: 0 solved, 49900 unsolved
Search for dead transitions found 0 dead transitions in 324002ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10603/21203 places, 50000/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 377434 ms. Remains : 10603/21203 places, 50000/60600 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-00
Stuttering criterion allowed to conclude after 514 steps with 0 reset in 46 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-00 finished in 377827 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' '!(F(G(p0)))'
Support contains 1 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9899 Post agglomeration using F-continuation condition.Transition count delta: 9899
Deduced a syphon composed of 9899 places in 32 ms
Reduce places removed 9899 places and 0 transitions.
Iterating global reduction 2 with 19798 rules applied. Total rules applied 21198 place count 10604 transition count 50001
Applied a total of 21198 rules in 17366 ms. Remains 10604 /21203 variables (removed 10599) and now considering 50001/60600 (removed 10599) transitions.
[2024-06-01 00:08:53] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
// Phase 1: matrix 40300 rows 10604 cols
[2024-06-01 00:09:04] [INFO ] Computed 102 invariants in 10127 ms
[2024-06-01 00:09:29] [INFO ] Implicit Places using invariants in 36033 ms returned []
Implicit Place search using SMT only with invariants took 36034 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-06-01 00:09:30] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-06-01 00:09:30] [INFO ] Invariant cache hit.
[2024-06-01 00:09:30] [INFO ] State equation strengthened by 29897 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30602 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 49901/49901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30525 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 0/49901 constraints, Known Traps: 0/0 constraints]
After SMT, in 332126ms problems are : Problem set: 0 solved, 49901 unsolved
Search for dead transitions found 0 dead transitions in 332681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10604/21203 places, 50001/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386161 ms. Remains : 10604/21203 places, 50001/60600 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-01
Product exploration explored 100000 steps with 199 reset in 4233 ms.
Product exploration explored 100000 steps with 199 reset in 4114 ms.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 40000 steps (77 resets) in 2283 ms. (17 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 71213 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 1
Probabilistic random walk after 71213 steps, saw 65336 distinct states, run finished after 3002 ms. (steps per millisecond=23 ) properties seen :0
[2024-06-01 00:15:15] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-06-01 00:15:15] [INFO ] Invariant cache hit.
[2024-06-01 00:15:15] [INFO ] State equation strengthened by 29897 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) 10401/10402 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:15:17] [INFO ] Deduced a trap composed of 2 places in 554 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10402 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10402 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 198/10600 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10600 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/10602 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:15:54] [INFO ] Deduced a trap composed of 106 places in 35307 ms of which 85 ms to minimize.
SMT process timed out in 39278ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 10604 transition count 50000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10603 transition count 50000
Partial Free-agglomeration rule applied 10101 times.
Drop transitions (Partial Free agglomeration) removed 10101 transitions
Iterating global reduction 1 with 10101 rules applied. Total rules applied 10103 place count 10603 transition count 50000
Applied a total of 10103 rules in 13486 ms. Remains 10603 /10604 variables (removed 1) and now considering 50000/50001 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13489 ms. Remains : 10603/10604 places, 50000/50001 transitions.
RANDOM walk for 37609 steps (61 resets) in 2698 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4170 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-06-01 00:16:13] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-06-01 00:16:13] [INFO ] Invariant cache hit.
[2024-06-01 00:16:38] [INFO ] Implicit Places using invariants in 25095 ms returned []
Implicit Place search using SMT only with invariants took 25096 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-06-01 00:16:38] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-06-01 00:16:38] [INFO ] Invariant cache hit.
[2024-06-01 00:16:39] [INFO ] State equation strengthened by 29897 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30550 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 49901/49901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30517 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 0/49901 constraints, Known Traps: 0/0 constraints]
After SMT, in 313494ms problems are : Problem set: 0 solved, 49901 unsolved
Search for dead transitions found 0 dead transitions in 313895ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 343220 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Computed a total of 303 stabilizing places and 500 stable transitions
Computed a total of 303 stabilizing places and 500 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 34242 steps (66 resets) in 2135 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 198 reset in 3961 ms.
Product exploration explored 100000 steps with 198 reset in 3744 ms.
Support contains 1 out of 10604 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10604/10604 places, 50001/50001 transitions.
Applied a total of 0 rules in 4076 ms. Remains 10604 /10604 variables (removed 0) and now considering 50001/50001 (removed 0) transitions.
[2024-06-01 00:22:05] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-06-01 00:22:05] [INFO ] Invariant cache hit.
[2024-06-01 00:22:30] [INFO ] Implicit Places using invariants in 24836 ms returned []
Implicit Place search using SMT only with invariants took 24839 ms to find 0 implicit places.
Running 49901 sub problems to find dead transitions.
[2024-06-01 00:22:30] [INFO ] Flow matrix only has 40300 transitions (discarded 9701 similar events)
[2024-06-01 00:22:30] [INFO ] Invariant cache hit.
[2024-06-01 00:22:31] [INFO ] State equation strengthened by 29897 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30525 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 49901/49901 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49901 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10603/50904 variables, and 100 constraints, problems are : Problem set: 0 solved, 49901 unsolved in 30536 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10604 constraints, ReadFeed: 0/29897 constraints, PredecessorRefiner: 0/49901 constraints, Known Traps: 0/0 constraints]
After SMT, in 318163ms problems are : Problem set: 0 solved, 49901 unsolved
Search for dead transitions found 0 dead transitions in 318663ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 347668 ms. Remains : 10604/10604 places, 50001/50001 transitions.
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-01 finished in 1154222 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' '!(F(G((F(p0) U p1))))'
Support contains 5 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9897 Post agglomeration using F-continuation condition.Transition count delta: 9897
Deduced a syphon composed of 9897 places in 23 ms
Reduce places removed 9897 places and 0 transitions.
Iterating global reduction 2 with 19794 rules applied. Total rules applied 21194 place count 10606 transition count 50003
Applied a total of 21194 rules in 16684 ms. Remains 10606 /21203 variables (removed 10597) and now considering 50003/60600 (removed 10597) transitions.
[2024-06-01 00:28:07] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
// Phase 1: matrix 40304 rows 10606 cols
[2024-06-01 00:28:17] [INFO ] Computed 102 invariants in 9817 ms
[2024-06-01 00:28:42] [INFO ] Implicit Places using invariants in 35370 ms returned []
Implicit Place search using SMT only with invariants took 35371 ms to find 0 implicit places.
Running 49903 sub problems to find dead transitions.
[2024-06-01 00:28:43] [INFO ] Flow matrix only has 40304 transitions (discarded 9699 similar events)
[2024-06-01 00:28:43] [INFO ] Invariant cache hit.
[2024-06-01 00:28:43] [INFO ] State equation strengthened by 29895 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10605/50910 variables, and 100 constraints, problems are : Problem set: 0 solved, 49903 unsolved in 30562 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10606 constraints, ReadFeed: 0/29895 constraints, PredecessorRefiner: 49903/49903 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49903 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 10605/50910 variables, and 100 constraints, problems are : Problem set: 0 solved, 49903 unsolved in 30523 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/10606 constraints, ReadFeed: 0/29895 constraints, PredecessorRefiner: 0/49903 constraints, Known Traps: 0/0 constraints]
After SMT, in 309900ms problems are : Problem set: 0 solved, 49903 unsolved
Search for dead transitions found 0 dead transitions in 310378ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10606/21203 places, 50003/60600 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 362511 ms. Remains : 10606/21203 places, 50003/60600 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-100-LTLCardinality-02
Stuttering criterion allowed to conclude after 542 steps with 0 reset in 29 ms.
FORMULA CANInsertWithFailure-PT-100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-100-LTLCardinality-02 finished in 362779 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' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 21203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21203/21203 places, 60600/60600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 700 transitions
Trivial Post-agglo rules discarded 700 transitions
Performed 700 trivial Post agglomeration. Transition count delta: 700
Iterating post reduction 0 with 700 rules applied. Total rules applied 700 place count 21203 transition count 59900
Reduce places removed 700 places and 0 transitions.
Iterating post reduction 1 with 700 rules applied. Total rules applied 1400 place count 20503 transition count 59900
Performed 9898 Post agglomeration using F-continuation condition.Transition count delta: 9898
Deduced a syphon composed of 9898 places in 30 ms
Reduce places removed 9898 places and 0 transitions.
Iterating global reduction 2 with 19796 rules applied. Total rules applied 21196 place count 10605 transition count 50002
Applied a total of 21196 rules in 16509 ms. Remains 10605 /21203 variables (removed 10598) and now considering 50002/60600 (removed 10598) transitions.
[2024-06-01 00:34:10] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
// Phase 1: matrix 40302 rows 10605 cols
[2024-06-01 00:34:19] [INFO ] Computed 102 invariants in 9633 ms
[2024-06-01 00:34:45] [INFO ] Implicit Places using invariants in 35593 ms returned []
Implicit Place search using SMT only with invariants took 35594 ms to find 0 implicit places.
Running 49902 sub problems to find dead transitions.
[2024-06-01 00:34:46] [INFO ] Flow matrix only has 40302 transitions (discarded 9700 similar events)
[2024-06-01 00:34:46] [INFO ] Invariant cache hit.
[2024-06-01 00:34:46] [INFO ] State equation strengthened by 29896 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CANInsertWithFailure-PT-100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r476-tall-171620505300171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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