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.r496-tall-171640603800611.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 GPUForwardProgress-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603800611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 00:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 00:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 00:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 00:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 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 62K 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 GPUForwardProgress-PT-40a-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-40a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717199201166

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:46:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:46:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:46:42] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-31 23:46:42] [INFO ] Transformed 168 places.
[2024-05-31 23:46:42] [INFO ] Transformed 209 transitions.
[2024-05-31 23:46:42] [INFO ] Found NUPN structural information;
[2024-05-31 23:46:42] [INFO ] Parsed PT model containing 168 places and 209 transitions and 821 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 42 transitions
Reduce redundant transitions removed 42 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 167/167 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 167
Applied a total of 1 rules in 24 ms. Remains 167 /168 variables (removed 1) and now considering 167/167 (removed 0) transitions.
// Phase 1: matrix 167 rows 167 cols
[2024-05-31 23:46:42] [INFO ] Computed 41 invariants in 16 ms
[2024-05-31 23:46:43] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-31 23:46:43] [INFO ] Invariant cache hit.
[2024-05-31 23:46:43] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:46:43] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-31 23:46:43] [INFO ] Invariant cache hit.
[2024-05-31 23:46:43] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 41/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 166/332 variables, 166/373 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 40/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 1/333 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 1/334 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/334 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 416 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15755 ms.
Refiners :[Domain max(s): 167/167 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 167/167 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 41/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 166/332 variables, 166/373 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 40/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 166/579 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 582 constraints, problems are : Problem set: 0 solved, 166 unsolved in 19847 ms.
Refiners :[Domain max(s): 167/167 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 167/167 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 35856ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 35870ms
Starting structural reductions in LTL mode, iteration 1 : 167/168 places, 167/167 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36496 ms. Remains : 167/168 places, 167/167 transitions.
Support contains 8 out of 167 places after structural reductions.
[2024-05-31 23:47:19] [INFO ] Flatten gal took : 56 ms
[2024-05-31 23:47:19] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:47:19] [INFO ] Input system was already deterministic with 167 transitions.
Support contains 6 out of 167 places (down from 8) after GAL structural reductions.
RANDOM walk for 29168 steps (38 resets) in 1482 ms. (19 steps per ms) remains 0/4 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.8 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))))'
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 7 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-05-31 23:47:20] [INFO ] Invariant cache hit.
[2024-05-31 23:47:20] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 23:47:20] [INFO ] Invariant cache hit.
[2024-05-31 23:47:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:47:20] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-31 23:47:20] [INFO ] Invariant cache hit.
[2024-05-31 23:47:20] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 41/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 166/332 variables, 166/373 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 40/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 1/333 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 1/334 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/334 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 416 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15659 ms.
Refiners :[Domain max(s): 167/167 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 167/167 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 41/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 166/332 variables, 166/373 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 40/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 166/579 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 582 constraints, problems are : Problem set: 0 solved, 166 unsolved in 19091 ms.
Refiners :[Domain max(s): 167/167 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 167/167 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 34962ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 34968ms
Finished structural reductions in LTL mode , in 1 iterations and 35308 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLCardinality-03
Product exploration explored 100000 steps with 33333 reset in 519 ms.
Product exploration explored 100000 steps with 33333 reset in 456 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-40a-LTLCardinality-03 finished in 36590 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(G(p0))))'
Support contains 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Applied a total of 0 rules in 12 ms. Remains 167 /167 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-05-31 23:47:56] [INFO ] Invariant cache hit.
[2024-05-31 23:47:56] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-31 23:47:56] [INFO ] Invariant cache hit.
[2024-05-31 23:47:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 23:47:56] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-31 23:47:56] [INFO ] Invariant cache hit.
[2024-05-31 23:47:56] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 41/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 166/332 variables, 166/373 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 40/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 1/333 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/333 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (OVERLAPS) 1/334 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (OVERLAPS) 0/334 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 416 constraints, problems are : Problem set: 0 solved, 166 unsolved in 15533 ms.
Refiners :[Domain max(s): 167/167 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 167/167 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 41/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 166/332 variables, 166/373 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/332 variables, 40/413 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/332 variables, 166/579 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 1/333 variables, 1/580 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/333 variables, 1/581 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/333 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 10 (OVERLAPS) 1/334 variables, 1/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/334 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 12 (OVERLAPS) 0/334 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 582 constraints, problems are : Problem set: 0 solved, 166 unsolved in 19211 ms.
Refiners :[Domain max(s): 167/167 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 167/167 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 34911ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 34916ms
Finished structural reductions in LTL mode , in 1 iterations and 35251 ms. Remains : 167/167 places, 167/167 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLCardinality-04 finished in 35392 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' '!(G(F(p0)))'
Support contains 1 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 39 Pre rules applied. Total rules applied 1 place count 125 transition count 126
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 79 place count 86 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 81 place count 85 transition count 125
Applied a total of 81 rules in 37 ms. Remains 85 /167 variables (removed 82) and now considering 125/167 (removed 42) transitions.
// Phase 1: matrix 125 rows 85 cols
[2024-05-31 23:48:32] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 23:48:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 23:48:32] [INFO ] Invariant cache hit.
[2024-05-31 23:48:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:48:32] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-31 23:48:32] [INFO ] Redundant transitions in 4 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-31 23:48:32] [INFO ] Invariant cache hit.
[2024-05-31 23:48:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 124/169 variables, 45/91 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 40/209 variables, 40/131 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 40/171 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/210 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/210 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/210 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 210/210 variables, and 172 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1707 ms.
Refiners :[Domain max(s): 85/85 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/45 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (OVERLAPS) 124/169 variables, 45/91 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 40/209 variables, 40/136 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 40/176 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 80/256 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/209 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/210 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/210 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 12 (OVERLAPS) 0/210 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 210/210 variables, and 257 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2988 ms.
Refiners :[Domain max(s): 85/85 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
After SMT, in 4767ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 4768ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/167 places, 125/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4948 ms. Remains : 85/167 places, 125/167 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLCardinality-05
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLCardinality-05 finished in 5039 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 2 out of 167 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 167/167 places, 167/167 transitions.
Graph (complete) has 536 edges and 167 vertex of which 126 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.2 ms
Discarding 41 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 39 Pre rules applied. Total rules applied 1 place count 126 transition count 127
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 0 with 78 rules applied. Total rules applied 79 place count 87 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 81 place count 86 transition count 126
Applied a total of 81 rules in 24 ms. Remains 86 /167 variables (removed 81) and now considering 126/167 (removed 41) transitions.
// Phase 1: matrix 126 rows 86 cols
[2024-05-31 23:48:37] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:48:37] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 23:48:37] [INFO ] Invariant cache hit.
[2024-05-31 23:48:37] [INFO ] State equation strengthened by 81 read => feed constraints.
[2024-05-31 23:48:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-31 23:48:37] [INFO ] Redundant transitions in 7 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-31 23:48:37] [INFO ] Invariant cache hit.
[2024-05-31 23:48:37] [INFO ] State equation strengthened by 81 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 125/210 variables, 85/171 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 80/251 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 1/211 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 254 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5677 ms.
Refiners :[Domain max(s): 86/86 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (OVERLAPS) 125/210 variables, 85/171 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 80/251 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 125/376 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 1/211 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 1/212 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/212 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/212 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 379 constraints, problems are : Problem set: 0 solved, 125 unsolved in 7911 ms.
Refiners :[Domain max(s): 86/86 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 86/86 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 13702ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 13703ms
Starting structural reductions in SI_LTL mode, iteration 1 : 86/167 places, 126/167 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13919 ms. Remains : 86/167 places, 126/167 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-40a-LTLCardinality-11
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 5 ms.
FORMULA GPUForwardProgress-PT-40a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-40a-LTLCardinality-11 finished in 13998 ms.
All properties solved by simple procedures.
Total runtime 128719 ms.
ITS solved all properties within timeout

BK_STOP 1717199331082

--------------------
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 LTLCardinality -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="GPUForwardProgress-PT-40a"
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 GPUForwardProgress-PT-40a, 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 r496-tall-171640603800611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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