fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r197-smll-167840343700067
Last Updated
May 14, 2023

About the Execution of ITS-Tools for GPUForwardProgress-PT-20a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
314.876 15498.00 25007.00 386.40 FTFFTTFTTFFTFTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r197-smll-167840343700067.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPUForwardProgress-PT-20a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343700067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 14:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 14:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 14:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 25 14:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 14:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 32K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-20a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678468866820

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20a
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-10 17:21:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 17:21:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:21:09] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2023-03-10 17:21:09] [INFO ] Transformed 88 places.
[2023-03-10 17:21:09] [INFO ] Transformed 109 transitions.
[2023-03-10 17:21:09] [INFO ] Found NUPN structural information;
[2023-03-10 17:21:09] [INFO ] Parsed PT model containing 88 places and 109 transitions and 421 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 87/87 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 87 transition count 87
Applied a total of 1 rules in 19 ms. Remains 87 /88 variables (removed 1) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2023-03-10 17:21:09] [INFO ] Computed 21 place invariants in 7 ms
[2023-03-10 17:21:10] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-10 17:21:10] [INFO ] Invariant cache hit.
[2023-03-10 17:21:10] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:10] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2023-03-10 17:21:10] [INFO ] Invariant cache hit.
[2023-03-10 17:21:10] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 87/88 places, 87/87 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 87/88 places, 87/87 transitions.
Support contains 34 out of 87 places after structural reductions.
[2023-03-10 17:21:10] [INFO ] Flatten gal took : 41 ms
[2023-03-10 17:21:10] [INFO ] Flatten gal took : 17 ms
[2023-03-10 17:21:10] [INFO ] Input system was already deterministic with 87 transitions.
Support contains 31 out of 87 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 32 resets, run finished after 293 ms. (steps per millisecond=34 ) properties (out of 19) seen :18
Finished Best-First random walk after 1880 steps, including 1 resets, run visited all 1 properties in 22 ms. (steps per millisecond=85 )
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 86 transition count 67
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 67 transition count 67
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 40 place count 66 transition count 66
Applied a total of 40 rules in 28 ms. Remains 66 /87 variables (removed 21) and now considering 66/87 (removed 21) transitions.
// Phase 1: matrix 66 rows 66 cols
[2023-03-10 17:21:11] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-10 17:21:11] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-10 17:21:11] [INFO ] Invariant cache hit.
[2023-03-10 17:21:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 17:21:11] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-10 17:21:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-10 17:21:11] [INFO ] Invariant cache hit.
[2023-03-10 17:21:11] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/87 places, 66/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 66/87 places, 66/87 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s14 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 73 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-00 finished in 767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p1 U p2))||F(p3)||p0)))'
Support contains 7 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2023-03-10 17:21:12] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-10 17:21:12] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-10 17:21:12] [INFO ] Invariant cache hit.
[2023-03-10 17:21:12] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:12] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-10 17:21:12] [INFO ] Invariant cache hit.
[2023-03-10 17:21:12] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 87/87 places, 87/87 transitions.
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s81 1)), p2:(OR (EQ s20 0) (EQ s77 1)), p1:(OR (EQ s58 0) (EQ s57 1)), p3:(EQ s73 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 796 ms.
Product exploration explored 100000 steps with 50000 reset in 433 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p2 p1 (NOT p3)), (X (NOT (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (OR (AND p2 (NOT p3)) (AND p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p1 (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p2) (NOT p1) (NOT p3))))
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-01 finished in 2224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(X(G(!p1))))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-10 17:21:14] [INFO ] Invariant cache hit.
[2023-03-10 17:21:14] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-10 17:21:14] [INFO ] Invariant cache hit.
[2023-03-10 17:21:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:14] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-10 17:21:14] [INFO ] Invariant cache hit.
[2023-03-10 17:21:14] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 349 ms. Remains : 87/87 places, 87/87 transitions.
Stuttering acceptance computed with spot in 161 ms :[p1, p1, p1, true, p1]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s61 0) (EQ s1 1)), p0:(OR (EQ s80 0) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-02 finished in 528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 86 transition count 67
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 67 transition count 67
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 40 place count 66 transition count 66
Applied a total of 40 rules in 21 ms. Remains 66 /87 variables (removed 21) and now considering 66/87 (removed 21) transitions.
// Phase 1: matrix 66 rows 66 cols
[2023-03-10 17:21:14] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-10 17:21:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-10 17:21:14] [INFO ] Invariant cache hit.
[2023-03-10 17:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 17:21:15] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-10 17:21:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:21:15] [INFO ] Invariant cache hit.
[2023-03-10 17:21:15] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/87 places, 66/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 66/87 places, 66/87 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-06 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p1)||p0))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 11 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2023-03-10 17:21:15] [INFO ] Computed 21 place invariants in 5 ms
[2023-03-10 17:21:15] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-10 17:21:15] [INFO ] Invariant cache hit.
[2023-03-10 17:21:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:15] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2023-03-10 17:21:15] [INFO ] Invariant cache hit.
[2023-03-10 17:21:15] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 353 ms. Remains : 87/87 places, 87/87 transitions.
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s12 0) (EQ s85 1)), p1:(AND (EQ s63 0) (EQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 397 ms.
Product exploration explored 100000 steps with 33333 reset in 403 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-08 finished in 1469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&G(!p0))))))'
Support contains 3 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 0 place count 86 transition count 67
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 67 transition count 67
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 40 place count 66 transition count 66
Applied a total of 40 rules in 18 ms. Remains 66 /87 variables (removed 21) and now considering 66/87 (removed 21) transitions.
// Phase 1: matrix 66 rows 66 cols
[2023-03-10 17:21:16] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-10 17:21:16] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-10 17:21:16] [INFO ] Invariant cache hit.
[2023-03-10 17:21:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 17:21:16] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-10 17:21:16] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 17:21:16] [INFO ] Invariant cache hit.
[2023-03-10 17:21:17] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/87 places, 66/87 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 66/87 places, 66/87 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s40 1), p0:(OR (EQ s49 0) (EQ s61 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-10 finished in 482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0&&G(p1)) U p2))))'
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
// Phase 1: matrix 87 rows 87 cols
[2023-03-10 17:21:17] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-10 17:21:17] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-10 17:21:17] [INFO ] Invariant cache hit.
[2023-03-10 17:21:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:17] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-10 17:21:17] [INFO ] Invariant cache hit.
[2023-03-10 17:21:17] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 87/87 places, 87/87 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p2), (NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s66 0) (EQ s38 1)), p0:(EQ s40 1), p1:(OR (EQ s22 0) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 376 ms.
Product exploration explored 100000 steps with 33333 reset in 391 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) p1), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-11 finished in 1387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p2)||p1))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-10 17:21:18] [INFO ] Invariant cache hit.
[2023-03-10 17:21:18] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 17:21:18] [INFO ] Invariant cache hit.
[2023-03-10 17:21:18] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:18] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-10 17:21:18] [INFO ] Invariant cache hit.
[2023-03-10 17:21:19] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 445 ms. Remains : 87/87 places, 87/87 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s51 0) (EQ s1 1)), p2:(OR (EQ s67 0) (EQ s14 1) (NOT (OR (EQ s45 0) (EQ s52 1)))), p0:(OR (EQ s45 0) (EQ s52 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Product exploration explored 100000 steps with 50000 reset in 308 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p2 p0)
Knowledge based reduction with 9 factoid took 357 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-14 finished in 1570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-10 17:21:20] [INFO ] Invariant cache hit.
[2023-03-10 17:21:20] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-10 17:21:20] [INFO ] Invariant cache hit.
[2023-03-10 17:21:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-10 17:21:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-10 17:21:20] [INFO ] Invariant cache hit.
[2023-03-10 17:21:20] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 397 ms. Remains : 87/87 places, 87/87 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s47 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Product exploration explored 100000 steps with 50000 reset in 295 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 276 edges and 87 vertex of which 66 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20a-LTLCardinality-15 finished in 1180 ms.
All properties solved by simple procedures.
Total runtime 12024 ms.

BK_STOP 1678468882318

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-20a, 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 r197-smll-167840343700067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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