fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r072-tall-174860067900659
Last Updated
June 24, 2025

About the Execution of ITS-Tools for Echo-PT-d02r09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 601154.00 0.00 0.00 TFTFFFFFTFTFFTTF normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860067900659.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is Echo-PT-d02r09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860067900659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 772K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 303K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748799518899

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 17:38:40] [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]
[2025-06-01 17:38:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 17:38:40] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-06-01 17:38:40] [INFO ] Transformed 735 places.
[2025-06-01 17:38:40] [INFO ] Transformed 570 transitions.
[2025-06-01 17:38:40] [INFO ] Found NUPN structural information;
[2025-06-01 17:38:40] [INFO ] Parsed PT model containing 735 places and 570 transitions and 3220 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d02r09-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r09-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 735 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 735/735 places, 570/570 transitions.
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 658 transition count 570
Applied a total of 77 rules in 72 ms. Remains 658 /735 variables (removed 77) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 658 cols
[2025-06-01 17:38:40] [INFO ] Computed 292 invariants in 221 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:38:46] [INFO ] Implicit Places using invariants in 6393 ms returned []
[2025-06-01 17:38:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:38:55] [INFO ] Implicit Places using invariants and state equation in 8726 ms returned []
Implicit Place search using SMT with State Equation took 15171 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-01 17:38:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 174/827 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 4/657 variables, 13/840 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 4/844 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 100/944 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 657/1228 variables, and 944 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30025 ms.
Refiners :[Domain max(s): 657/658 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 274/279 constraints, State Equation: 0/658 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 174/827 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/827 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 4/657 variables, 13/840 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/657 variables, 4/844 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/657 variables, 100/944 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 657/1228 variables, and 944 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30024 ms.
Refiners :[Domain max(s): 657/658 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 274/279 constraints, State Equation: 0/658 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60265ms
Starting structural reductions in LTL mode, iteration 1 : 658/735 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75528 ms. Remains : 658/735 places, 570/570 transitions.
Support contains 34 out of 658 places after structural reductions.
[2025-06-01 17:39:56] [INFO ] Flatten gal took : 94 ms
[2025-06-01 17:39:56] [INFO ] Flatten gal took : 54 ms
[2025-06-01 17:39:56] [INFO ] Input system was already deterministic with 570 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (244 resets) in 1340 ms. (29 steps per ms) remains 1/17 properties
BEST_FIRST walk for 40003 steps (11 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
[2025-06-01 17:39:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 4/1228 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 20 ms.
Refiners :[Domain max(s): 0/658 constraints, Positive P Invariants (semi-flows): 0/13 constraints, Generalized P Invariants (flows): 0/279 constraints, State Equation: 0/658 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA Echo-PT-d02r09-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
Computed a total of 658 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 658 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1923 edges and 658 vertex of which 649 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 52 ms. Remains 648 /658 variables (removed 10) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2025-06-01 17:39:57] [INFO ] Computed 284 invariants in 131 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:04] [INFO ] Implicit Places using invariants in 7260 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 7265 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/658 places, 568/570 transitions.
Applied a total of 0 rules in 33 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7351 ms. Remains : 644/658 places, 568/570 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-05
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 10 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-05 finished in 7561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((X(F(!p1))||G(!p2)))&&p0))))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 654 transition count 570
Applied a total of 4 rules in 14 ms. Remains 654 /658 variables (removed 4) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2025-06-01 17:40:04] [INFO ] Computed 288 invariants in 112 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:13] [INFO ] Implicit Places using invariants in 8368 ms returned []
[2025-06-01 17:40:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:40:21] [INFO ] Implicit Places using invariants and state equation in 8134 ms returned []
Implicit Place search using SMT with State Equation took 16507 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-01 17:40:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30028 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30022 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60201ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 654/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76734 ms. Remains : 654/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p1 p2), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-06
Stuttering criterion allowed to conclude after 162 steps with 0 reset in 2 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-06 finished in 76973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Graph (complete) has 1923 edges and 658 vertex of which 649 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.4 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 36 ms. Remains 648 /658 variables (removed 10) and now considering 568/570 (removed 2) transitions.
// Phase 1: matrix 568 rows 648 cols
[2025-06-01 17:41:21] [INFO ] Computed 284 invariants in 115 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:41:29] [INFO ] Implicit Places using invariants in 8036 ms returned [93, 122, 125, 154]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 8039 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 644/658 places, 568/570 transitions.
Applied a total of 0 rules in 28 ms. Remains 644 /644 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8103 ms. Remains : 644/658 places, 568/570 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-07
Stuttering criterion allowed to conclude after 1631 steps with 13 reset in 20 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-07 finished in 8204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||((G(p1) U p2) U G(p3))||F(p1)))'
Support contains 7 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 655 transition count 570
Applied a total of 3 rules in 13 ms. Remains 655 /658 variables (removed 3) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2025-06-01 17:41:30] [INFO ] Computed 289 invariants in 116 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:41:37] [INFO ] Implicit Places using invariants in 7119 ms returned []
[2025-06-01 17:41:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:41:45] [INFO ] Implicit Places using invariants and state equation in 7983 ms returned []
Implicit Place search using SMT with State Equation took 15104 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-01 17:41:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 257/910 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 3/913 constraints. Problems are: Problem set: 0 solved, 569 unsolved
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 30131ms
Starting structural reductions in LTL mode, iteration 1 : 655/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45257 ms. Remains : 655/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 448 ms.
Product exploration explored 100000 steps with 50000 reset in 488 ms.
Computed a total of 655 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 655 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p3 p2 (NOT p1) p0), (X p2), (X p3), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X p2)), (X (X (NOT p1))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (AND p3 p2 (NOT p1)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (AND p3 (NOT p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 26 ms. Reduced automaton from 7 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLCardinality-10 finished in 46724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0||G(p1)) U X(G(p2))))'
Support contains 6 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 654 transition count 570
Applied a total of 4 rules in 8 ms. Remains 654 /658 variables (removed 4) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 654 cols
[2025-06-01 17:42:16] [INFO ] Computed 288 invariants in 104 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:42:24] [INFO ] Implicit Places using invariants in 7611 ms returned []
[2025-06-01 17:42:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:42:32] [INFO ] Implicit Places using invariants and state equation in 7823 ms returned []
Implicit Place search using SMT with State Equation took 15438 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-01 17:42:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30020 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 283/936 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/1224 variables, and 936 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30019 ms.
Refiners :[Domain max(s): 653/654 constraints, Generalized P Invariants (flows): 283/288 constraints, State Equation: 0/654 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Starting structural reductions in LTL mode, iteration 1 : 654/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75598 ms. Remains : 654/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1476 steps with 9 reset in 13 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-12 finished in 75791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 655 transition count 570
Applied a total of 3 rules in 11 ms. Remains 655 /658 variables (removed 3) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2025-06-01 17:43:32] [INFO ] Computed 289 invariants in 113 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:43:39] [INFO ] Implicit Places using invariants in 7197 ms returned []
[2025-06-01 17:43:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:43:50] [INFO ] Implicit Places using invariants and state equation in 11359 ms returned []
Implicit Place search using SMT with State Equation took 18560 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-01 17:43:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 190/843 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 90/938 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/1225 variables, and 938 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30022 ms.
Refiners :[Domain max(s): 654/655 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 280/285 constraints, State Equation: 0/655 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 190/843 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 4/847 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 90/938 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1225 variables, and 938 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30021 ms.
Refiners :[Domain max(s): 654/655 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 280/285 constraints, State Equation: 0/655 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 655/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78710 ms. Remains : 655/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-13
Product exploration explored 100000 steps with 50000 reset in 340 ms.
Product exploration explored 100000 steps with 50000 reset in 370 ms.
Computed a total of 655 stabilizing places and 570 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 655 transition count 570
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p1), (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d02r09-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r09-LTLCardinality-13 finished in 79785 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 570/570 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 655 transition count 570
Applied a total of 3 rules in 7 ms. Remains 655 /658 variables (removed 3) and now considering 570/570 (removed 0) transitions.
// Phase 1: matrix 570 rows 655 cols
[2025-06-01 17:44:52] [INFO ] Computed 289 invariants in 127 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:44:59] [INFO ] Implicit Places using invariants in 7219 ms returned []
[2025-06-01 17:44:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:47:39] [INFO ] Implicit Places using invariants and state equation in 160020 ms returned []
Implicit Place search using SMT with State Equation took 167243 ms to find 0 implicit places.
Running 569 sub problems to find dead transitions.
[2025-06-01 17:47:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 148/801 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 132/938 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 654/1225 variables, and 938 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30032 ms.
Refiners :[Domain max(s): 654/655 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 280/285 constraints, State Equation: 0/655 constraints, PredecessorRefiner: 569/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 569 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 653/653 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 148/801 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 3 (OVERLAPS) 1/654 variables, 4/805 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/654 variables, 1/806 constraints. Problems are: Problem set: 0 solved, 569 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/654 variables, 132/938 constraints. Problems are: Problem set: 0 solved, 569 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 654/1225 variables, and 938 constraints, problems are : Problem set: 0 solved, 569 unsolved in 30017 ms.
Refiners :[Domain max(s): 654/655 constraints, Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 280/285 constraints, State Equation: 0/655 constraints, PredecessorRefiner: 0/569 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 569 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Starting structural reductions in LTL mode, iteration 1 : 655/658 places, 570/570 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 227389 ms. Remains : 655/658 places, 570/570 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r09-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d02r09-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r09-LTLCardinality-15 finished in 227497 ms.
All properties solved by simple procedures.
Total runtime 599610 ms.

BK_STOP 1748800120053

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="Echo-PT-d02r09"
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-5832"
echo " Executing tool itstools"
echo " Input is Echo-PT-d02r09, 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 r072-tall-174860067900659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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